Scheduling with Deadlines and Loss Functions on k Parallel Machines
- 1 January 1965
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 11 (3) , 460-475
- https://doi.org/10.1287/mnsc.11.3.460
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: