An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance

Title
An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance
Authors
Keywords
Distributed permutation flowshop scheduling problem, Makespan, Preventive maintenance, Iterated greedy algorithm, Heuristic methods
Journal
EXPERT SYSTEMS WITH APPLICATIONS
Volume 169, Issue -, Pages 114495
Publisher
Elsevier BV
Online
2020-12-16
DOI
10.1016/j.eswa.2020.114495

Ask authors/readers for more resources

Reprint

Contact the author

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started