Scheduling with Deadlines and Loss Functions on k Parallel Machines

James G. Root
Additional contact information
James G. Root: The Ohio State University, Columbus

Management Science, 1965, vol. 11, issue 3, 460-475

Abstract: An optimal schedule is developed for H jobs on K identical machines in single stage production. The optimal schedule minimizes \sum 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.

Date: 1965
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.11.3.460 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:11:y:1965:i:3:p:460-475

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().