Many real-world scheduling problems are solved to obtain optimal solutions in term of processing time, cost, and quality as optimization objectives. Currently, energyefficiency is also taken into consideration in these ...

[EN] The manufacturer industry is characterized by the presence of highly repetitive movements, which is a major risk factor associated with work musculoskeletal disorders (WMSDs). Moreover, this risk factor worsens when ...

This paper deals with a variant of flowshop scheduling, namely, the hybrid or flexible flowshop with sequence dependent setup times. This type of flowshop is frequently used in the batch production industry and helps reduce ...

[EN] This work presented in this paper is based on the simulation of the routing flexibility enabled manufacturing system. In this study four levels of each factor (i.e. routing flexibility, system load conditions, system ...

[EN] In this paper, we study the unrelated parallel machine scheduling problem with one scarce additional resource to minimise the maximum completion time of the jobs or makespan. Several heuristics are proposed following ...

El problema presentado es bien conocido en la literatura, y está clasificado como NP-duro. Por ello, se hacen necesarios algoritmos eficientes para su resolución. En este trabajo se proponen diferentes algoritmos matheurísticos, ...

[EN] In this work a new benchmark of hard instances for the permutation flowshop scheduling problem with the objective of minimising the makespan is proposed. The new benchmark consists of 240 large instances and 240 small ...

The main goal of this project is to work on CPU scheduling algorithms to improve the performance of jobs consisting of parallel communicating tasks and analyse the results with simulation. It is known that the use of Virtual ...

Multi-objective optimisation problems have seen a large impulse in the last decades. Many new techniques for solving distinct variants of multi-objective problems have been proposed. Production scheduling, as with other ...

[EN] In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job differs from machine to machine. We deal ...