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!
Beschreibung
Zusammenfassung:•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 such characteristics is designed.•Solving and implementation complications are discussed in detail.•Thorough computational experiments are performed to compare the performance of the developed models and algorithms. This paper deals with the no-wait flow shop scheduling problem with due date constraints. In the no-wait flow shop problem, waiting time is not allowed between successive operations of jobs. Moreover, the jobs should be completed before their respective due dates; due date constraints are dealt with as hard constraints. The considered performance criterion is makespan. The problem is strongly NP-hard. This paper develops a number of distinct mathematical models for the problem based on different decision variables. Namely, a mixed integer programming model, two quadratic mixed integer programming models, and two constraint programming models are developed. Moreover, a novel graph representation is developed for the problem. This new modeling technique facilitates the investigation of some of the important characteristics of the problem; this results in a number of propositions to rule out a large number of infeasible solutions from the set of all possible permutations. Afterward, the new graph representation and the resulting propositions are incorporated into a new exact algorithm to solve the problem to optimality. To investigate the performance of the mathematical models and to compare them with the developed exact algorithm, a number of test problems are solved and the results are reported. Computational results demonstrate that the developed algorithm is significantly faster than the mathematical models.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2016.12.013