摘要
This paper investigates a multi-objective optimization distributed no-wait permutation flow shop scheduling problem under the constraint of sequence dependent setup time. Our optimization case is minimizing the makespan and maximum tardiness criteria. Therefore, our main objective will be to find the optimal jobs sequence that minimizes a function representing the two criteria of makespan and maximum tardiness. This function will be linearly dependent of these two criteria via a weighting parameter for each criterion. To solve this industrial problem, we propose the mixed integer linear programming (MILP) and a set of efficient metaheuristics solving different size instances. To this end, we suggest three inspired nature metaheuristics: The genetic algorithm (GA), the artificial bee colony (ABC) algorithm and migratory bird optimization (MBO) algorithm. We suggest a total of six new algorithms based on nature inspired metaheuristics. Also, two constructive heuristics are used, the greedy randomized adaptive search procedure (GRASP) and Nawaz-Enscore-Ham (NEH) algorithms. It was revealed that GA algorithm with NEH initialization gives the best results comparing to the other metaheuristics.
学科与关键词
- Minimizing the maximum tardiness for a permutation flow shop problem under the constraint of sequence independent setup timeElissaouy, Oualid*; Allali, KaramRAIRO-OPERATIONS RESEARCH, 2024, 58(1): 373-395.被引 1
- Improved NSGA-II for energy-efficient distributed no-wait flow-shop with sequence-dependent setup timeZeng, Qing-qing; Li, Jun-qing*; Li, Rong-hao; Huang, Ti-hao; Han, Yu-yan; Sang, Hong-yanComplex & Intelligent Systems, 2023, 9(1): 825-849.被引 13
- Scheduling a Bi-Objective Hybrid Flow Shop with Sequence-Dependent Family Setup Times Using MetaheuristicsFadaei, M.; Zandieh, M.*ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2013, 38(8): 2233-2244.被引 18
