On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness

On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness

A branch-and-bound algorithm for a two-machine scheduling problem by Grabowski is generalized to the case of an arbitrary number of machines. The lower bounds are obtained by the relaxation of the capacity constraints on the machines. An approach to strengthen these lower bounds is developed. Comput...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of the Operational Research Society 1983-07, Vol.34 (7), p.615-620
Hauptverfasser: Grabowski, Józef, Skubalska, Ewa, Smutnicki, Czesław
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
branch and bound method
Business and Management
Descendants
Integers
Job shops
machinery
Machines
Management
Operations research
Operations Research/Decision Theory
Production scheduling
Scheduling
Technical Note
Technical Notes
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A branch-and-bound algorithm for a two-machine scheduling problem by Grabowski is generalized to the case of an arbitrary number of machines. The lower bounds are obtained by the relaxation of the capacity constraints on the machines. An approach to strengthen these lower bounds is developed. Computational experience with 6-, 10-, 15-, 20-, 30-, 40-, 50-job problems is presented.
ISSN:0160-5682
1476-9360
DOI:10.1057/jors.1983.142