This article addresses the permutation flowshop scheduling problem with the objective of minimizing the total completion time subject to a makespan constraint. The makespan is related to system utilization while the total completion time is related to the waiting time, and hence to the work in process (WIP); in real contexts, focusing on both total completion time and makespan allows a good trade-off between WIP and utilization to be found. Two local search algorithms are developed in the paper and, by using an extensive computational experience on literature benchmark instances, they are proved to be able to find good solutions both for regular and no-wait flowshops.
An effective approach for total completion time minimization subject to makespan constraint in permutation flowshops / Pastore, Erica; Alfieri, Arianna. - In: ENGINEERING OPTIMIZATION. - ISSN 0305-215X. - (2024). [10.1080/0305215X.2024.2302909]
An effective approach for total completion time minimization subject to makespan constraint in permutation flowshops
Pastore, Erica;Alfieri, Arianna
2024
Abstract
This article addresses the permutation flowshop scheduling problem with the objective of minimizing the total completion time subject to a makespan constraint. The makespan is related to system utilization while the total completion time is related to the waiting time, and hence to the work in process (WIP); in real contexts, focusing on both total completion time and makespan allows a good trade-off between WIP and utilization to be found. Two local search algorithms are developed in the paper and, by using an extensive computational experience on literature benchmark instances, they are proved to be able to find good solutions both for regular and no-wait flowshops.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2985738
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo