Minimizing total completion time in the two-machine no-idle no-wait flow shop problem

Federico Della Croce (), Andrea Grosso () and Fabio Salassa ()
Additional contact information
Federico Della Croce: DIGEP, Politecnico di Torino
Andrea Grosso: D.I., Universitá degli Studi di Torino
Fabio Salassa: DIGEP, Politecnico di Torino

Journal of Heuristics, 2021, vol. 27, issue 1, No 7, 159-173

Abstract: 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.

Keywords: No-idle no-wait shop scheduling; Flow shop; Total completion time; Matheuristics (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10732-019-09430-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joheur:v:27:y:2021:i:1:d:10.1007_s10732-019-09430-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10732

DOI: 10.1007/s10732-019-09430-z

Access Statistics for this article

Journal of Heuristics is currently edited by Manuel Laguna

More articles in Journal of Heuristics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().