基于三个影响因子的单机排序问题.docVIP

  1. 1、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
基于三个影响因子的单机排序问题 田桂鑫 曲光夫 兰州大学数学与统计学院,兰州市  730000 摘要:本文考虑基于退化、指数学习效应和开始时间三个影响因子的单机排序问题,也就是说 工件的实际加工时间不仅与之前加工的工件有关,而且与所处的工件加工位置和开始加工时间 有关系。这篇文章给出一个新的模型,并且证明单机排序问题的最小化时间表长、最小化总完 工时间及最小化所有工件完工时间的平方和问题能根据 SPT 规则(最短加工时间优先规则) 得到最优解。并且证明在给定的条件下,最小化最大延误和最小化加权总完工时间问题能得到 最优解。 关键词:单机排序,退化,指数学习效应,开始加工时间 中图分类号: O224,O231 Single-machine scheduling with three in?uencing factors for job processing time TIAN Gui-Xin QU Guang-Fu School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000 Abstract: This paper considers the single machine scheduling problems with time-dependent deterioration and exponential learning e?ect and the starting time, i.e. the actual processing time of a job depends not only on the processing time of the jobs already processed but also on its scheduled position and its starting time. Here considers a new model and shows that the single machine scheduling problems to minimize the makespan and the total completion time and the sum of the 2th power of job completion times can be solved by the smallest(normal) processing time ?rst (SPT) rule respectively. It can be proved that the total weighted completion time minimization problem and the maximum lateness minimization problem are polynomially solvable under certain conditions. Key words: single machine scheduling, deterioration, exponential learning e?ect, starting time 0 Introduction In classical scheduling theory, job processing times are supposed to be ?xed and constant values. In practice,however, there are many situations that the processing times of jobs may 基金项目: 作者简介: Tian Gui-Xin(1986-),female,major research direction:Institute of Operations Research and Control Theory. Qu Guang-Fu (1988-) , male, major research direction:Computational Mathematics. -1- be subject to change due to deterioration and starting time and learning phenomena. In many real-life scheduling setting a job processed later consumes more time than when it is processed earlier, this phenomenon is known as scheduling wit

文档评论(0)

文档分享 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档