Flow shop-sequencing problem with synchronous transfers and makespan minimization

Flow shop-sequencing problem with synchronous transfers and makespan minimization

This study considers a permutation flow shop-sequencing problem with synchronous transfers between stations. The objective is to minimize the makespan. It is shown that the problem is strongly NP-hard. A branch-and-bound algorithm together with several lower and upper bounding procedures are develop...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production research 2007-08, Vol.45 (15), p.3311-3331
Hauptverfasser: Soylu, B., Kirca, Ö., Azizoğlu, M.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Assembly lines
Branch & bound algorithms
Branch-and-bound
Exact sciences and technology
Flow shops
Inventory control, production control. Distribution
Job shops
Makespan
Operational research and scientific management
Operational research. Management science
Scheduling
Scheduling, sequencing
Sequential scheduling
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This study considers a permutation flow shop-sequencing problem with synchronous transfers between stations. The objective is to minimize the makespan. It is shown that the problem is strongly NP-hard. A branch-and-bound algorithm together with several lower and upper bounding procedures are developed. The algorithm returns optimal solutions to moderate-sized problem instances in reasonable solution times.
ISSN:0020-7543
1366-588X
DOI:10.1080/00207540600621672