Mixed integer programming formulations for single machine scheduling problems

In this paper, the computational performance of four different mixed integer programming (MIP) formulations for various single machine scheduling problems is studied. Based on the computational results, we discuss which MIP formulation might work best for these problems. The results also reveal that...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & industrial engineering Jg. 56; H. 1; S. 357 - 367
Hauptverfasser: Keha, Ahmet B., Khowala, Ketan, Fowler, John W.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Elsevier Ltd 01.02.2009
Pergamon Press Inc
Schlagworte:
Integer programming
Job shops
Mixed integer programming
Production scheduling
Single machine scheduling
Studies
Valid inequalities
Mixed integer programming
Single machine scheduling
Valid inequalities
ISSN:0360-8352, 1879-0550
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, the computational performance of four different mixed integer programming (MIP) formulations for various single machine scheduling problems is studied. Based on the computational results, we discuss which MIP formulation might work best for these problems. The results also reveal that for certain problems a less frequently used MIP formulation is computationally more efficient in practice than commonly used MIP formulations. We further present two sets of inequalities that can be used to improve the formulation with assignment and positional date variables.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2008.06.008