- 1、本文档共24页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
《2016 A time-indexed LP-based approach for min-sum job-shop problems》.pdf
Ann Oper Res (2011) 186:175–198
DOI 10.1007/s10479-010-0832-9
A time-indexed LP-based approach for min-sum
job-shop problems
Giuseppe Lancia · Franca Rinaldi · Paolo Serafini
Published online: 14 January 2011
© Springer Science+Business Media, LLC 2011
Abstract In this paper we propose two time-indexed IP formulations for job-shop schedul-
ing problems with a min-sum objective. The first model has variables associated to job
scheduling patterns. The exponential number of variables calls for a column generation
scheme which is carried out by a dynamic programming procedure. The second model is
of network flow type with side constraints. This model can be strengthened by adding cut-
ting inequalities of clique type. It turns out that the two models are equivalent, since the dual
of the second formulation is equivalent to the compact dual of the first model. However,
they require significantly different solution approaches and may behave differently in terms
of computing time and memory usage. Good upper bounds are found by a heuristic proce-
dure that randomly generates schedules from fractional solutions. These features allow for
an effective pruning of the branch-and-bound tree and narrowing the gap between lower and
upper bounds. However, the size of both models is critically affected by the time-indexed
formulation which may heavily slow down the computation.
Keywords Job-shop · Flow-shop · Total weighted completion time · Time-indexed
formulation
1 Introduction
The job-shop problem has been extensively studied in the last three decades especially in
the formulation of makespan minimization. Although there are good heuristic procedures
based on local search (for instance, the celebrated shifting bottleneck procedure (Adams et
G. Lancia ( ) · F. Rinaldi · P. Serafini
Department of Mathematics and Computer Science, University of Udine, Via delle Scienze 206, Udine,
Italy
e-mail: giuseppe.lancia@un
您可能关注的文档
- 《144个PR3-5可以做外链的地址—混凝土英才网(hnt.job1001.com)》.xls
- 《14705194-Lean-Suggested-Readings-and-Reference books list》.xls
- 《14种java开发工具介绍》.doc
- 《15 芯嵌STM32入门系列教程之十五《点亮LCD液晶屏》》.pdf
- 《15-防火墙与Linux代理服务器》.doc
- 《15level_iii_mock_exam-2016-2016-GIPS》.pdf
- 《16 fundamentals of system-level pwb technologies》.pdf
- 《16 java2实用教程(第三版)第十六章》.ppt
- 《16 Level characteristics corresponding to peripheral eigenvalues of a nonnegative matrix》.pdf
- 《16-A Job Interview》.doc
- 江苏省灌云高级中学2023-2024学年高三上学期第一次月考地理试题含答案.docx
- 备战2024年高考物理一轮重难点复习 第十三章 近代物理.docx
- 江苏省高邮市一中2021-2022学年高三上学期第一次月考语文试题(原卷版).docx
- 江苏省华罗庚中学2023-2024学年高三上学期12月阶段检测数学试卷含答案.docx
- 江苏省海门中学2023-2024学年高三上学期第一次调研考试地理试题及答案.docx
- 备战2024年高考物理一轮重难点复习 第九章 恒定电流.docx
- 江苏省高邮市2023-2024学年高三下学期3月学情调研数学试题含答案.docx
- 备战2024年高考物理一轮重难点复习 实验十一:探究影响感应电流方向的因素.docx
- 备战2024年高考物理一轮重难点复习 实验三:验证平行四边形定则.docx
- 备战2024年高考物理一轮重难点复习 第十四章 光.docx
文档评论(0)