Scheduling with parallel processors and linear delay costs

Kenneth R. Baker and Alan G. Merten

Naval Research Logistics Quarterly, 1973, vol. 20, issue 4, 793-804

Abstract: This paper deals with the sequencing problem of minimizing linear delay costs with parallel identical processors. The theoretical properties of this m‐machine problem are explored, and the problem of determining an optimum scheduling procedure is examined. Properties of the optimum schedule are given as well as the corresponding reductions in the number of schedules that must be evaluated in the search for an optimum. An experimental comparison of scheduling rules is reported; this indicates that although a class of effective heuristics can be identified, their relative behavior is difficult to characterize.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/nav.3800200417

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:navlog:v:20:y:1973:i:4:p:793-804

Access Statistics for this article

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