Branch and bound algorithm for the flow shop with multiple processors

The sequencing of a flow shop with multiple processors at each stage is a general case of the flow shop problem. It involves sequencing n jobs in a flow shop where, for at least one stage, the facility has one or more identical machines. The purpose of this paper is to present a branch and bound alg...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research 1991-03, Vol.51 (1), p.88-99
Hauptverfasser:	Brah, Shaukat A., Hunsucker, John L.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applications Applied sciences branch and bound Exact sciences and technology Flowshop Job shops Mathematical models multiple processors Multiprocessing Operational research and scientific management Operational research. Management science Operations research Production scheduling Scheduling, sequencing Statistical analysis Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!