An effective approach for total completion time minimization subject to makespan constraint in permutation flowshops

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 proce...

Full description

Saved in:
Bibliographic Details
Published inEngineering optimization Vol. 56; no. 12; pp. 2148 - 2163
Main Authors Pastore, E., Alfieri, A.
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 01.12.2024
Taylor & Francis Ltd
Subjects
Completion time
Constraints
makespan
permutation flowshop
Permutations
Scheduling
Search algorithms
total completion time
Workflow
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-215X
1029-0273
DOI:10.1080/0305215X.2024.2302909