摘要
In this work, a hybrid algorithm has been proposed to solve bi-objective permutation flow shop scheduling problem. The primary concern of flow shop scheduling problem considered in this work is to obtain the best sequence, which minimizes the makespan and the total flow time of all jobs. Bi-objective issues are comprehended by doling out uniform weight to every objective function in view of its preference or determining every competent solutions. In the flow shop scheduling environment, many meta-heuristic algorithms have been used to find optimal or near-optimal solutions due to the computational cost of determining exact solutions. This work provides a hybridization of genetic algorithm and simulated annealing algorithm (HGASA) based multi-objective optimization algorithm for flow shop scheduling. The proposed HGASA algorithm is used to solve a bi-objective problem that minimizes the makespan and the total flow time. The performance of the proposed algorithm is demonstrated by applying it to benchmark problems available in the OR-Library. The test results show that the HGASA algorithm performed better in terms of searching quality and efficiency than other meta-heuristic algorithms.
学科与关键词
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithmZobolas, G. I.*; Tarantilis, C. D.; Ioannou, G.COMPUTERS & OPERATIONS RESEARCH, 2009, 36(4): 1249-1267.被引 117
- ALGORITHMS FOR BICRITERIA MINIMIZATION IN THE PERMUTATION FLOW SHOP SCHEDULING PROBLEMMokotoff, Ethel*Journal of Industrial and Management Optimization, 2011, 7(1): 253-282.被引 4
- An adaptive hybrid metaheuristic for permutation flowshop schedulingMoccellin, JV*; dos Santos, MOCONTROL AND CYBERNETICS, 2000, 29(3): 761-771.被引 3
