.png){kind=icon}
Return
Mixed integer programming formulations for single machine scheduling problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2008.06.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2008 Elsevier Ltd. All rights reserved.
Keywords:
Single machine scheduling
Mixed integer programming
Valid inequalities
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
Cited Papers
ShareSaveThird-order exceptional point and successive switching among three states in an optical microcavity
OAAI
OAAIShareSaveShareSaveCredit Market Shocks and Economic Fluctuations: Evidence from Corporate Bond and Stock Markets.png)
OAAI
IF0
OAAIShareSaveShareSaveAN ALGORITHM FOR SINGLE-MACHINE SEQUENCING WITH DEADLINES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME
PREAI
ShareSave
View more