- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Operations Research and Fuzziology 运筹与模糊学, 2017, 7(1), 1-9
Published Online February 2017 in Hans. /journal/orf
/10.12677/orf.2017.71001
Single-Machine Due-Window Assignment
and Scheduling with Discretely Controllable
Job Processing Times and a Deteriorating
Rate-Modifying Activity
Lei Zhang
School of Mathematics and Systems Science, Shenyang Normal University, Shenyang Liaoning
th st th
Received: Feb. 4 , 2017; accepted: Feb. 21 , 2017; published: Feb. 24 , 2017
Abstract
In this paper, we consider single-machine due-window assignment and scheduling with discretely
controllable job processing times and a deteriorating rate-modifying activity. Each job has mul-
tiple processing times to be selected and different processing times are associated with different
costs. In addition, we can schedule a deteriorating rate-modifying activity in order to reduce the
total cost. We consider two versions of the problem, in the first version, all the jobs share a com-
mon due-window and in the second version, each job has their own due-window. The objective is
to determine the optimal job sequence, schedule the deteriorating rate-modifying activity and the
due-window, so as to minimize the total cost. We provide polynomial-time algorithms for the con-
sidered problems.
Keywords
Scheduling, Single-Machine, Discretely Controllable Job Processing Times, Deteriorating
Rate-Modifying Activity, Due-Window
带有退化维修和交货期窗口的加工时间
分别可控的单机排序问题
张 蕾
沈阳师范大学数学与系统科学学院,辽宁 沈阳
收稿日期:2017年2月4 日;录用日期:2017年2月21 日;发布日期:2017年2月24 日
文章引用: 张蕾. 带有退化维修和交货期窗口的加工时间分别可控的单机排序问题[J]. 运筹与模糊学, 2017, 7(1): 1-9.
/10.12677/orf.2017.71001
张蕾
摘 要
本文讨论了带有退化维修和交货期窗口的加工时间分别可控的单机排序问题。每个工
文档评论(0)