论文信息 - Technical Note - A Note on the Weighted Tardiness Problem

Technical Note - A Note on the Weighted Tardiness Problem

We identify a condition characterizing adjacent jobs in an optimal sequence for the weighted tardiness problem. This condition can be used as an effective pruning device in enumerative methods. Further, we show that the Modified Due Date Rule is a special case of this condition. Lastly, we identify a set of circumstances under which the first job in an optimal sequence can be determined without fully solving the problem.

Ram Mohan V. Rachamadugu | R. Rachamadugu

[1] Jwm Will Bertrand,et al. A dynamic priority rule for scheduling against due-dates , 1982 .

[2] Maurice Queyranne,et al. The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

[3] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .

[4] B. J. Lageweg,et al. Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..

[5] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .

[6] Chris N. Potts,et al. A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[7] Hamilton Emmons,et al. One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[8] Thomas E. Morton,et al. Myopic Heuristics for the Single Machine Weighted Tardiness Problem , 1982 .