Paper Info
Title
Minimizing Total Completion Time In The Two-Machine No-Idle No-Wait Flow Shop Problem
Abstract
We consider the two-machine total completion time flow shop problem with additional requirements. These requirements are the so-called no-idle constraint where the machines must operate with no inserted idle time and the so-called no-wait constraint where jobs cannot wait between the end of an operation and the start of the following one. We propose a matheuristic approach that uses an ILP formulation based on positional completion times variables and exploits the structural properties of the problem. The proposed approach shows very competitive performances on instances with up to 500 jobs in size.
Year
DOI
Venue
2021
10.1007/s10732-019-09430-z
JOURNAL OF HEURISTICS
Keywords
DocType
Volume
No-idle no-wait shop scheduling, Flow shop, Total completion time, Matheuristics
Journal
27
Issue
ISSN
Citations 
1-2
1381-1231
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Federico Della Croce139941.60
Andrea Grosso245028.55
Fabio Salassa3569.79