Self-Adaptive Population-Based Iterated Greedy Algorithm for Distributed Permutation Flowshop Scheduling Problem with Part of Jobs Subject to a Common Deadline Constraint

Although the distributed permutation flowshop scheduling problem (DPFSP) has recently received extensive research attention, most studies assume that either all jobs have due date constraints or none of them do. Nevertheless, in practice, it is very common to schedule jobs with due dates alongside j...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Expert systems with applications Jg. 248; S. 123278
Hauptverfasser:	Li, Qiu-Ying, Pan, Quan-Ke, Sang, Hong-Yan, Jing, Xue-Lei, Framiñán, Jose M., Li, Wei-Min
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 15.08.2024
Schlagworte:	Deadline Distributed permutation flowshop Iterated greedy Scheduling Total completion time Distributed permutation flowshop Scheduling Iterated greedy Total completion time Deadline
ISSN:	0957-4174, 1873-6793
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!