Title of article :
Single-machine scheduling with a common due window
Author/Authors :
David W. K. Yeung، نويسنده , , Ceyda Oguz، نويسنده , , T. C. Edwin Cheng، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2001
Pages :
19
From page :
157
To page :
175
Abstract :
We study several single-machine non-preemptive scheduling problems to minimize the sum of weighted earliness–tardiness, weighted number of early and tardy jobs, common due window location, and flowtime penalties. We allow the due window location to be either a decision variable or a given parameter. We assume that the due window location has a tolerance and the window size is a given parameter. We further make the assumption that the ratios of the job processing times to the earliness–tardiness weights are agreeable for the first problem. We propose pseudo-polynomial dynamic programming algorithms to optimally solve the problems. We also provide polynomial time algorithms for several special cases.
Keywords :
Single-machine scheduling , Earliness–tardiness , Early–tardy jobs , Due window , Dynamic programming , flowtime
Journal title :
Computers and Operations Research
Serial Year :
2001
Journal title :
Computers and Operations Research
Record number :
927128
Link To Document :
بازگشت