节点文献

工时依赖位置的宽容期单机排序问题

A single machine scheduling of due window with position-dependent processing time

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 赵林王龙奎

【Author】 ZHAO Lin,WANG Long-kui(Department of Mathematics and Physics,Anhui University of Architecture,Hefei 230601,China)

【机构】 安徽建筑工业学院数理系

【摘要】 研究了共同宽容交货期的单机排序问题,即加工时间是位置的函数,所有工件的提前/延误费用相同,共同宽容交货期的开始时间和大小待定,目标函数最小化的总惩罚费用(包括提前、延误、宽容交货期的定位和大小费用四部分).并给出了最优排序的性质,提出了一个多项式时间算法.

【Abstract】 We studied a single and machine scheduling problem in which all jobs had a common due window,the processing time was a function of its position,all jobs had common earliness costs and common tardiness penalties,the common due window starting time and the size were decision variables,the objective function was the minimized total penalty costs.Following some properties of the optimal scheduling,a polynomial algorithm was proposed here.

【关键词】 排序单机共同宽容期加工时间
【Key words】 schedulingsingle machinecommon due windowprocessing time
  • 【文献出处】 安徽大学学报(自然科学版) ,Journal of Anhui University(Natural Sciences) , 编辑部邮箱 ,2009年06期
  • 【分类号】O223
  • 【被引频次】1
  • 【下载频次】20
节点文献中: 

本文链接的文献网络图示:

本文的引文网络