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 ...
In this work a genetic algorithm is presented for the unrelated parallel machine scheduling problem in which machine and job sequence dependent setup times are considered. The proposed genetic algorithm includes a fast ...
[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 ...
[EN] Purpose: This paper reviews current literature and contributes a set of findings that capture the
current state-of-the-art of the topic of lot streaming in a flow-shop.
Design/methodology/approach: A literature ...
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 ...
Lot-streaming flow shops have important applications in different industries including textile, plastic,
chemical, semiconductor and many others. This paper considers an n-job m-machine lot-streaming
flow shop scheduling ...
Khan, Wasif Ullah; Ali, Mohammed(Universitat Politècnica de València, 2019-07-31)
[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] The traditional production scheduling problem considers performance
indicators such as processing time, cost and quality as optimization objectives in
manufacturing systems; however, it does not take energy consumption ...
[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 ...
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 ...
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 paper we analyze a parallel machine scheduling problem in which the processing of jobs on the machines requires a number of units of a scarce resource. This number depends both on the job and on the machine. ...
Vallada Regalado, Eva; Ruiz García, Rubén; Framinan, Jose M.(Elsevier, 2015-02-01)
[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 ...
Para iniciar esta Tesis Doctoral se buscó un problema de producción sencillo
pero de amplia aplicación práctica que permitiera adaptarlo para llegar
a problemas más generales y de más amplia aplicación. Por este motivo, ...
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 ...
Se muestra cómo se puede usar un grafo para representar una solución en un problema de secuenciación en mñaquinas y el uso de la técnica de camino crítico para calcular la fecha de fin del último trabajo (makespan)
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 two generalizations of the well known unrelated parallel machines scheduling problem under makespan (Cmax) minimization. First, a situation in which not every available parallel machine should ...
[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 ...