Note on the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks

Note on the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks

In this note the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks is addressed. The objective function to be minimized is the maximum completion time or the makespan. The main purpose of this note is to pinpoint an inaccuracy contained in a recent paper while developing a lower bound (Ch...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production economics 2016-12, Vol.182, p.531-534
1. Verfasser: Hidri, Lotfi
Format: Artikel
Sprache:eng
Schlagworte:
Accuracy
Flowcharts
Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks
Job shops
Lower bounds
Scheduling algorithms
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this note the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks is addressed. The objective function to be minimized is the maximum completion time or the makespan. The main purpose of this note is to pinpoint an inaccuracy contained in a recent paper while developing a lower bound (Chou: IJPE, 141:137–145 ) and to propose some valid lower bounds.
ISSN:0925-5273
1873-7579
DOI:10.1016/j.ijpe.2016.10.001