Scheduling with Deadlines and Loss Functions on k Parallel Machines
暂无分享，去创建一个
An optimal schedule is developed for H jobs on K identical machines in single stage production. The optimal schedule minimizes ∑b[max (0, Ai − di)] where Ai is the actual completion time for job i and di is the deadline for job i. A common deadline, t0, is assumed for all jobs, i.e., di = t0, i = 1, …, H.
[1] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[2] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .
[3] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[4] Albert Schild,et al. On Scheduling Tasks with Associated Linear Loss Functions , 1961 .
[5] Irwin J. Fredman,et al. Scheduling Tasks with Deadlines and Non-Linear Loss Functions , 1962 .