.png){kind=icon}
返回
Solving the single-machine sequencing problem using integer programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2010.07.028.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Various integer programming models have been proposed for sequencing problems. However, little is known about the practical value of these models. This paper reports a comparison of six different integer programming formulations of the single-machine total tardiness problem. We created a set of especially difficult test problems and attempted to solve them with each of the formulations, using CPLEX software. We found that one formulation performs much more effectively than the others. A generic integer programming approach is still not capable of solving problems with hundreds of jobs, so in that respect, it does not compete with state-of-the-art tardiness algorithms. However, the integer programming approach remains viable for problems containing as many as 40 or 50 jobs and may be the better algorithmic choice when convenience in implementation is considered. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Sequencing
Integer programming
Tardiness problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏Neurocognitive Deficits in Alcoholics and Social Drinkers: A Continuum?酗酒者和社交饮酒者的神经认知缺陷: 一个连续体？
PREAI
分享收藏Induction and elimination of bulky benzo[a]pyrene-related DNA adducts and 8-oxodGuo in mussels Mytilus galloprovincialis exposed in vivo to B[a]P-contaminated feed体内暴露于B[a]P污染的饲料中的贻贝Mytilus galloprovincialis中庞大的苯并 [a] re相关DNA加合物和8-氧代果的诱导和消除
OAAI
OAAI分享收藏
分享收藏
查看更多内容