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

Full description

Bibliographic Details

Published in:	Expert systems with applications Vol. 248; p. 123278
Main Authors:	Li, Qiu-Ying, Pan, Quan-Ke, Sang, Hong-Yan, Jing, Xue-Lei, Framiñán, Jose M., Li, Wei-Min
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 15.08.2024
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!