摘要
The rapid growth of distributed manufacturing in industry today has recently attracted significant research attention that has focused on distributed scheduling problems. This work studied the distributed mixed no-idle flowshop scheduling problem using makespan as an optimality criterion. To the best of the authors' knowledge, this is the first paper to study the multi-flowshop extension in which each flowshop has mixed no-idle constraints. A novel cloud theory-based iterated greedy (CTBIG) algorithm was proposed for solving the problem. Computational experiments conducted on a set of test instances revealed that the proposed CTBIG algorithm significantly outperformed classic iterated greedy algorithms.
学科与关键词
关键词
schedulingmakespanmetaheuristicsdistributed mixed no-idle flowshopcloud theory-based iterated greedy algorithm
- Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup timesRossi, Fernando Luis*; Nagano, Marcelo SeidoCOMPUTERS & INDUSTRIAL ENGINEERING, 2021, 157: 107337.被引 26
- Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasksYing, Kuo-Ching; Lin, Shih-Wei*EXPERT SYSTEMS WITH APPLICATIONS, 2018, 92: 132-141.被引 110
- Distributed shop scheduling: A comprehensive review on classifications, models and algorithmsDuan, Jianguo; Wang, Mengting*; Zhang, Qinglei; Qin, JiyunMathematical Biosciences and Engineering, 2023, 20(8): 15265-15308.被引 5
