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...

Celý popis

Podrobná bibliografie

Vydáno v:	Expert systems with applications Ročník 248; s. 123278
Hlavní autoři:	Li, Qiu-Ying, Pan, Quan-Ke, Sang, Hong-Yan, Jing, Xue-Lei, Framiñán, Jose M., Li, Wei-Min
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 15.08.2024
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!