Carregant...
Carregant...

Vés al contingut (premeu Retorn)

An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem

Autor
Ribas, I.; Companys , R.; Tort, X.
Tipus d'activitat
Article en revista
Revista
Expert systems with applications
Data de publicació
2019-05-01
Volum
121
Pàgina inicial
347
Pàgina final
361
DOI
https://doi.org/10.1016/j.eswa.2018.12.039 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/127883 Obrir en finestra nova
URL
https://www.sciencedirect.com/science/article/pii/S0957417418308078 Obrir en finestra nova
Resum
This paper proposes an iterated greedy algorithm for scheduling jobs in F parallel flow shops (lines), each consisting of a series of m machines without storage capacity between machines. This constraint can provoke the blockage of machines if a job has finished its operation and the next machine is not available. The criterion considered is the minimization of the sum of tardiness of all the jobs to schedule, i.e., minimization of the total tardiness of jobs. Notice that the proposed method is ...
Citació
Ribas, I.; Companys , R.; Tort, X. An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem. "Expert systems with applications", 1 Maig 2019, vol. 121, p. 347-361.
Paraules clau
Blocking, Distribution flow shop, Parallel flow shop, Scheduling Total tardiness
Grup de recerca
SCOM - Supply Chain and Operations Management

Participants