.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Single machine scheduling
Mixed integer programming
Valid inequalities
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
Third-order exceptional point and successive switching among three states in an optical microcavity光学微腔中三阶异常点和三个状态之间的连续切换
OAAI
OAAI分享收藏Credit Market Shocks and Economic Fluctuations: Evidence from Corporate Bond and Stock Markets.png)
OAAI
IF0
OAAI分享收藏AN ALGORITHM FOR SINGLE-MACHINE SEQUENCING WITH DEADLINES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME
PREAI
分享收藏
查看更多内容