On scheduling with earliest starts and due dates on a group of identical machines

Charles Tilquin

Naval Research Logistics Quarterly, 1975, vol. 22, issue 4, 777-785

Abstract: This paper examines the (n, m) scheduling problem with n operations distributed among m machines. An algorithm for solving this problem is presented and, gives a good heuristic solution on a wide class of problems. Computational results are reported which demonstrate the efficiency of this approach.

Date: 1975
References: Add references at CitEc
Citations:

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

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:22:y:1975:i:4:p:777-785

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 ().