An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time

This article addresses the m-machine no-wait flowshop scheduling problem with the objective of minimizing makespan subject to an upper bound on total completion time. An iterated greedy-with-local-search algorithm is proposed and compared with a mathematical model and the best method found in the li...

Full description

Saved in:
Bibliographic Details
Published inEngineering optimization Vol. 53; no. 8; pp. 1431 - 1449
Main Authors Nagano, Marcelo Seido, de Almeida, Fernando Siqueira, Miyata, Hugo Hissashi
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 03.08.2021
Taylor & Francis Ltd
Subjects
Algorithms
Completion time
Flowshop
Greedy algorithms
Job shops
makespan
Mathematical models
no-wait
Scheduling
Search algorithms
Statistical analysis
total completion time
Upper bounds
Online AccessGet full text

Cover

More Information
Summary:This article addresses the m-machine no-wait flowshop scheduling problem with the objective of minimizing makespan subject to an upper bound on total completion time. An iterated greedy-with-local-search algorithm is proposed and compared with a mathematical model and the best method found in the literature for solving this problem. Computational experiments and statistical analysis are conducted to evaluate the methods. The results show that the proposed approach offers fast and high quality solutions when compared with the mathematical model and at the same time outperforms the best existing algorithm in effectiveness and efficiency.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-215X
1029-0273
DOI:10.1080/0305215X.2020.1797000