This paper investigates the common due-window assignment scheduling problem with deteriorating jobs on a single machine in which the processing time of a job is a proportional function of its starting time.The goal is...This paper investigates the common due-window assignment scheduling problem with deteriorating jobs on a single machine in which the processing time of a job is a proportional function of its starting time.The goal is to minimize the maximum value of earliness and tardiness penalties,as well as due-window location cost,and size cost.Depending on whether the location and size of due-window are known,this paper studies three relevant cases,all of which are solvable in polynomial time.展开更多
基金supported by LiaoNing Revitalization Talents Program(No.XLYC2002017).
文摘This paper investigates the common due-window assignment scheduling problem with deteriorating jobs on a single machine in which the processing time of a job is a proportional function of its starting time.The goal is to minimize the maximum value of earliness and tardiness penalties,as well as due-window location cost,and size cost.Depending on whether the location and size of due-window are known,this paper studies three relevant cases,all of which are solvable in polynomial time.
