《2016 Using dispatching rules for job shop scheduling with due date-based objectives》.pdf
- 1、本文档共18页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
《2016 Using dispatching rules for job shop scheduling with due date-based objectives》.pdf
International Journal of Production Research,
Vol. 45, No. 14, 15 July 2007, 3245–3262
Using dispatching rules for job shop scheduling
with due date-based objectives
T. C. CHIANG* and L. C. FU
Department of Computer Science and Information Engineering, National Taiwan
University, Post Addr. No. 1, Sec. 4, Roosevelt Road, Taipei, Taiwan 106
(Revision received March 2006)
9
0 This paper addresses the job shop-scheduling problem with due date-based
0
2
y objectives including the tardy rate, mean tardiness and maximum tardiness. The
r
a focused approach is the dispatching rules. Eighteen dispatching rules are selected
u
n
a from the literature, and their features and design concepts are discussed. Then a
J
4 dispatching rule is proposed with the goal of achieving a good and balanced
1
8 performance when more than one objective is concerned at the same time. First,
5
: three good design principles are recognized from the existing rules. Second,
2
0
: it introduces a due date extension procedure to solve a problem of negative
t
A allowance time. Third, a job candidate reduction mechanism is developed to make
]
y the rule computationally efficient. Lastly, a comprehensive simulation study is
t
i
s conducted with the 1
文档评论(0)