摘要
A two-machine flowshop scheduling problem is addressed to minimize setups and makespan where each job is characterized by a pair of attributes that entail setups on each machine. The setup times are sequence-dependent on both machines. It is shown that these objectives conflict, so the Pareto optimization approach is considered. The scheduling problems considering either of these objectives are NP - hard, so exact optimization techniques are impractical for large-sized problems. We propose two multi-objective metaheurisctics based on genetic algorithms (MOGA) and simulated annealing (MOSA) to find approximations of Pareto-optimal sets. The performances of these approaches are compared with lower bounds for small problems. In larger problems, performance of the proposed algorithms are compared with each other. Experimentations revealed that both algorithms perform very similar on small problems. Moreover, it was observed that MOGA outperforms MOSA in terms of the quality of solutions on larger problems.
学科与关键词
- 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
- ALGORITHMS FOR BICRITERIA MINIMIZATION IN THE PERMUTATION FLOW SHOP SCHEDULING PROBLEMMokotoff, Ethel*Journal of Industrial and Management Optimization, 2011, 7(1): 253-282.被引 4
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problemMinella, Gerardo*; Ruiz, Ruben; Ciavotta, MicheleINFORMS JOURNAL ON COMPUTING, 2008, 20(3): 451-471.被引 132
