- 1、本文档共13页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
《2016 On the identical parallel-machine rescheduling with job rework disruption 》.pdf
Computers Industrial Engineering 66 (2013) 186–198
Contents lists available at SciVerse ScienceDirect
Computers Industrial Engineering
journal homepage: /locate/caie
On the identical parallel-machine rescheduling with job rework
disruption q
Le Liu, Hong Zhou ⇑
School of Economics and Management, Beihang University, Beijing 100191, People’s Republic of China
a r t i c l e i n f o a b s t r a c t
Article history: This paper investigates an issue of rescheduling on identical parallel machines where the original jobs
Received 22 September 2011 have already been scheduled to minimize the total completion time, when a single set of jobs to be
Received in revised form 25 July 2012 reworked re-arrives and creates a job rework disruption. Two conflicting rescheduling criteria are consid-
Accepted 23 February 2013
ered: the total completion time, as the measure of scheduling cost (efficiency); and the number of jobs
Available online 5 March 2013
assigned to different machines in the original schedule and newly generated schedule, as the measure
of disruption cost (stability). Further, the rescheduling problem is defined as a bi-criteria scheduling
Keywords:
problem. Two polynomial time algorithms are proposed to lexicographically optimize the two criteria.
Scheduling
Besides, the set of all efficient schedules with respect to the two criter
文档评论(0)