- 1、本文档共10页,可阅读全部内容。
- 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 A heuristic algorithm for solving flexible job shop scheduling problem》.pdf
Int J Adv Manuf Technol (2014) 71:519–528
DOI 10.1007/s00170-013-5510-z
ORIGINAL ARTICLE
A heuristic algorithm for solving flexible job shop
scheduling problem
Mohsen Ziaee
Received: 14 December 2011 /Accepted: 18 November 2013 /Published online: 1 December 2013
# Springer-Verlag London 2013
Abstract This paper deals with the flexible job shop sched- a set of n jobs must be processed on a group of m machines,
uling problem with the objective of minimizing the makespan. where the processing of each job i consists of J i operations
An efficient heuristic based on a constructive procedure is performed on these machines. Each job has a specified pro-
developed to obtain high-quality schedules very quickly. The cessing order on the machines which is fixed and known in
algorithm is tested on benchmark instances from the literature advance, i.e., each operation has to be performed on a given
in order to evaluate its performance. Computational results machine. Moreover, the processing times of all operations are
show that, despite its simplicity, the proposed heuristic can fixed and known. Each machine is continuously available
obtain effective solutions in very short and nearly zero time from time zero and can process at most one operation at a
and is comparable with even metaheuristic algorithms and time. The operations are processed on the machines without
promising for practical problems. interruption [2]. A typical performance indicator for the JSP is
the makespan, i.e., the time needed to complete all the jobs.
In modern manufacturing environments, a machine may
Keywords Scheduling . Flexible job
您可能关注的文档
- 《12 java2实用教程(第三版)第十二章》.ppt
- 《120724-未来黄金白银泡沫解析 By Jordan Roy》.doc
- 《1214.Java 7程序设计》.pdf
- 《122道经典java程序员面试》.doc
- 《12Light harvesting in OSCs》.pdf
- 《13 Becoming a Servant Leader》.pdf
- 《13-Lesson 13 by东环中学》.pptx
- 《130328从Lighting Japan 2016剖析LEDOLED照明產业技术发展趋势 》.pdf
- 《13款让人惊艳的创意LED灯具》.doc
- 《14 java2实用教程(第三版)第十四章》.ppt
- 《2016 A Hybrid Cascaded Multi-level Converter for Power Storage System》.pdf
- 《2016 A hybrid harmony search algorithm for the flexible job shop scheduling problem》.pdf
- 《2016 A hybrid single and dual population search procedure for the job shop scheduling problem》.pdf
- 《2016 A Linear Programming Based Method for Job Shop Scheduling》.pdf
- 《2016 A Macro-Level Scheduling Method Using Lagrangian Relaxation》.pdf
- 《2016 A note on flow-shop and job-shopbatch scheduling with identical processing-time jobs》.pdf
- 《2016 A novel initialization method for solving flexible job-shop scheduling problem》.pdf
- 《2016 A priority list based heuristic for the job shop problem》.pdf
- 《2016 A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem》.pdf
- 《2016 A time-indexed LP-based approach for min-sum job-shop problems》.pdf
文档评论(0)