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

Full description

Saved in:
Bibliographic Details
Published in:Computers & industrial engineering Vol. 56; no. 1; pp. 357 - 367
Main Authors: Keha, Ahmet B., Khowala, Ketan, Fowler, John W.
Format: Journal Article
Language:English
Published: New York Elsevier Ltd 01.02.2009
Pergamon Press Inc
Subjects:
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 Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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