Two-machine flow-shop sequencing with sparse precedence constraints

Two-machine flow-shop sequencing with sparse precedence constraints

The n- job two-machine flow-shop problem with sparse precedence constraints is considered with the objective to minimize makespan. We present a branch and bound algorithm which employs a lower bounding rule based on an adjustment of the sequence obtained by applying Johnson's algorithm. We demo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & industrial engineering 1994, Vol.26 (1), p.173-180
Hauptverfasser: Gim, Bongjin, Curry, Guy L., Deuermeyer, Bryan L.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Decision making models
Exact sciences and technology
Industrial engineering
Job shops
Machine shops
Operational research and scientific management
Operational research. Management science
Operations research
Production scheduling
Scheduling, sequencing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The n- job two-machine flow-shop problem with sparse precedence constraints is considered with the objective to minimize makespan. We present a branch and bound algorithm which employs a lower bounding rule based on an adjustment of the sequence obtained by applying Johnson's algorithm. We demonstrate that our proposed branch and bound algorithm is effective for the problems having sparse precedence constraints.
ISSN:0360-8352
1879-0550
DOI:10.1016/0360-8352(94)90035-3