An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times

The distributed permutation flowshop scheduling problem (DPFSP) has attracted much attention in recent years. In this paper, we extend the DPFSP by considering the sequence-dependent setup time (SDST), and present a mathematical model and an iterated greedy algorithm with a restart scheme (IGR). In...

Full description

Saved in:
Bibliographic Details
Published in:Swarm and evolutionary computation Vol. 59; p. 100742
Main Authors: Huang, Jiang-Ping, Pan, Quan-Ke, Gao, Liang
Format: Journal Article
Language:English
Published: Elsevier B.V 01.12.2020
Subjects:
ISSN:2210-6502
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first