Scheduling to a common due date on parallel uniform processors

Hamilton Emmons

Naval Research Logistics (NRL), 1987, vol. 34, issue 6, 803-810

Abstract: We consider scheduling a set of jobs on parallel processors, when all jobs have a common due date and earliness and lateness are penalized at different cost rates. For identical processors, the secondary criteria of minimizing makespan and machine occupancy are addressed. The extension to different, uniform processors is also solved.

Date: 1987
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (25)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198712)34:63.0.CO;2-2

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:wly:navres:v:34:y:1987:i:6:p:803-810

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().