Notes REPLY TO GRAVES AND HAESSLER'S NOTE ON THE PAPER "PRODUCTION RUNS FOR MULTIPLE PRODUCTS: THE TWO-PRODUCT HEURISTIC"

Notes REPLY TO GRAVES AND HAESSLER'S NOTE ON THE PAPER "PRODUCTION RUNS FOR MULTIPLE PRODUCTS: THE TWO-PRODUCT HEURISTIC"

[1] presents a heuristic method for scheduling N products on one machine, by dividing them into two groups and scheduling the production of the groups by a simpler algorithm appropriate for scheduling two products. Although no claim was made that the resulting N-product schedule would be optimal, th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Management science 1978-07, Vol.24 (11), p.1197
Hauptverfasser: Mayberry, John P, SAIPE, ALAN L
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Heuristic
Restrictions
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:[1] presents a heuristic method for scheduling N products on one machine, by dividing them into two groups and scheduling the production of the groups by a simpler algorithm appropriate for scheduling two products. Although no claim was made that the resulting N-product schedule would be optimal, the paper did state that the simpler algorithm [1, 3] was optimal for the two-product case.
ISSN:0025-1909
1526-5501