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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Swarm and evolutionary computation Ročník 59; s. 100742
Hlavní autoři: Huang, Jiang-Ping, Pan, Quan-Ke, Gao, Liang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.12.2020
Témata:
Flowshop
Iterated greedy algorithm
Meta-heuristics
Scheduling
Iterated greedy algorithm
Scheduling
Flowshop
Meta-heuristics
ISSN:2210-6502
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!
Popis
Shrnutí: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 the IGR, we discard the simulated annealing-like acceptance criterion commonly used in traditional iterated greedy algorithms. A restart scheme with six different operators is proposed to ensure the diversity of the solutions and help the algorithm to escape from local optimizations. Furthermore, to achieve a balance between the exploitation and exploration, we introduce an algorithmic control parameter in the IG stage. Additionally, to further improve the performance of the algorithm, we propose two local search methods based on a job block which is built in the evolution process. A detailed design experiment is carried out to calibrate the parameters for the presented IGR algorithm. The IGR is assessed through comparing with the state-of-the-art algorithms in the literature. The experimental results show that the proposed IGR algorithm is the best-performing one among all the algorithms in comparison.
ISSN:2210-6502
DOI:10.1016/j.swevo.2020.100742