Scheduling with Deadlines and Loss Functions on <i>k</i> 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, A i − d i )] where A i is the actual completion time for job i and d i is the deadline for job i. A common deadline, t 0 , is assumed for all jobs, i.e., d i = t 0 , i = 1, …, H.

• 저널Management Science · 11(3) · 460–475
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.11.3.460
• 저자James G. Root