[EN] In recent years, a large number of heuristics have been proposed for the minimization of the total or mean flowtime/completion time of the well-known permutation flowshop scheduling problem. Although some literature ...

[EN] The solution of fleet assignment problems is one of the core points in the management of a car-rental company. These problems arise from the restrictions imposed by the acceptance of reservations of the customers and ...

[EN] In this paper, we study an assembly line balancing problem that occurs in sheltered worker centres for the disabled, where workers with very different characteristics are present. We are interested in the situation ...

Many planning domains have to deal with temporal features that can be expressed using durations that are associated to actions. Unfortunately, the conservative model of actions used in many existing temporal planners is ...

[ES] El crecimiento de las webs permite que los usuarios tengan una mayor elección a la hora de decidir donde navegar por internet. La importancia de disponer de un sitio web con un nivel adecuado de usabilidad y ...

[EN] Differentiating between users that interact simultaneously on a tabletop could be beneficial for collaborative tasks. Hence, the applications could support more effectively several territoriality-oriented features and ...

This paper analyzes the solvability of a railway network design problem and its robust version. These problems are modeled as integer linear programming problems with binary variables, and their solutions provide topological ...

Task scheduling has a significant impact on the performance of the MapReduce computing framework. In this paper, a scheduling problem of periodical batch jobs with makespan minimization is considered. The problem is ...

This paper discusses horizontal cooperation in road transportation and supports the relevance of this praxis as a way of reducing delivery costs and greenhouse gas emissions. In a competitive market, costs reduction due ...

[EN] The aim of this study was to compare the performance of the well-known genetic algorithms and tabu search heuristics with the financial problem of the partial tracking of a stock market index. Although the weights of ...