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

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

作　　者：赵林[1] 王龙奎[1] 

机构地区：[1]安徽建筑工业学院数理系,安徽合肥230601

出　　处：《安徽大学学报（自然科学版）》2009年第6期34-36,共3页Journal of Anhui University(Natural Science Edition)

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

关 键 词：排序 单机 共同宽容期 加工时间 

分 类 号：O223[理学—运筹学与控制论]