论文信息 - Optimal assignment of due-dates for a single processor scheduling problem

Optimal assignment of due-dates for a single processor scheduling problem

Given processing times of n jobs on a single machine with penalties for earliness and tardiness and penalties associated with assignment of due-dates, the objective is to select optimal due-dates and optimal sequence. Scheduling procedure for the solution of this problem is presented along with proof of optimality and illustrative numerical examples.

[1] Salah E. Elmaghraby. The machine sequencing problem – review and extensions , 1968 .

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

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

[4] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .

[5] James K. Weeks,et al. A Methodology for Assigning Minimum Cost Due-Dates , 1977 .

[6] C. Jones. An Economic Evaluation of Job Shop Dispatching Rules , 1973 .

[7] V. Srinivasan. A hybrid algorithm for the one machine sequencing problem to minimize total tardiness , 1971 .

[8] James K. Weeks. A Simulation Study of Predictable Due-Dates , 1979 .

[9] Linus Schrage,et al. Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks , 1978, Oper. Res..

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