- 1、本文档共15页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
《2016 An efficient algorithm for solving the felxible job shop scheduling problem》.pdf
AN EFFICIENT ALGORITHM FOR SOLVING THE
FLEXIBLE JOB SHOP SCHEDULING PROBLEM
Karin Thörnblad *,1
Ann-Brith Strömberg **,3
Michael Patriksson **,4
Torgny Almgren*,2
*) GKN Aerospace Engine Systems, Dept. of Logistics Development,
461 81 Trollhättan, Sweden
1
) E-mail: karin.thornblad@ , Tel: +46 520 29 22 66
2
) E-mail: torgny.almgren@ , Tel: +46 520 29 22 62
**) Chalmers University of Technology and University of Gothenburg,
Dept. of Mathematical Sciences, 421 96 Göteborg, Sweden
3
) E-mail: anstr@chalmers.se, Tel: +46 31 772 53 78
4
) E-mail: mipat@chalmers.se, Tel: +46 31 772 35 29
ABSTRACT
Purpose
To investigate the efficiency of a discretization procedure utilizing a time-indexed mathe-
matical optimization model for finding accurate solutions to flexible job shop scheduling
problems considering objectives comprising makespan and tardiness, respectively.
Design/methodology/approach
A time-indexed mixed integer programming model is used to find solutions by iteratively
employing time steps of decreasing length. The solutions and computation times are
compared with results from a known benchmark formulation and an alternative model.
Findings
The proposed method finds significantly better solutions for the largest instances within the
same time frame. Both the other models are better choices for some smaller instances,
which is expected since the new method is designed for larger problems. Only our alter-
native model is able to solve two of
您可能关注的文档
- 《163disk.com_Java基础教程》.pdf
- 《16×16 LED点阵电子显示屏的设计 》.pdf
- 《17 java2实用教程(第三版)第十七章》.ppt
- 《17 Jazz Age Elements》.ppt
- 《17 LCD1602 液晶屏显示》.pdf
- 《1778.Java Web开发技术》.pdf
- 《1883[]Brodric The reform of the English land system》.pdf
- 《19 The Mean Sea Level Aquifer》.pdf
- 《1910.Java经典入门教程 》.pdf
- 《1983 Surrogate duality relaxation for job shop scheduling》.pdf
- 《2016 An efficient knowledge-based algorithm for the flexible job shop scheduling problem》.pdf
- 《2016 An efficient priority rule for scheduling job shops to minimize mean tardiness》.pdf
- 《2016 An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem》.pdf
- 《2016 An improved shifting bottleneck procedure for the job shop scheduling problem》.pdf
- 《2016 An Integrated Greedy Heuristic for a Flexible Job Shop Scheduling Problem》.pdf
- 《2016 An integrated search heuristic for large-scale flexible job shop scheduling problems》.pdf
- 《2016 Approximate Level Method for Nonsmooth Convex Minimization》.pdf
- 《2016 Benchmarking flexible job-shop scheduling and control systems》.pdf
- 《2016 Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization》.pdf
- 《2016 Changes in the Planning and Control System during Implementation of Lean Production》.pdf
文档评论(0)