On the exact solution of the no-wait flow shop problem with due date constraints

•Five different mathematical programming models and two constraint programming models are developed for the no-wait flow shop problem with due date constraints.•Unique characteristics of the problem are discussed and a number of propositions are proved; an exact algorithm that takes advantage of suc...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research Jg. 81; S. 141 - 159
Hauptverfasser:	Samarghandi, Hamed, Behroozi, Mehdi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Elsevier Ltd 01.05.2017 Pergamon Press Inc
Schlagworte:	Algorithms Constraint programming Due date constraints Enumeration algorithm Graph representations Integer programming Job shops Mathematical models Mixed integer programming No-wait flow shop Scheduling algorithms Studies Mixed integer programming Enumeration algorithm No-wait flow shop Due date constraints Constraint programming
ISSN:	0305-0548, 1873-765X, 0305-0548
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!