Hybrid monkey search algorithm for flow shop scheduling problem under makespan and total flow time |
| |
| Affiliation: | 1. Department of Industrial and Management Systems Engineering, Kuwait University, P.O. Box 5969, Safat, Kuwait;2. Department of Mathematics and Natural Sciences, Gulf University for Science and Technology, P.O. Box 7207, Hawally 32093, Kuwait;3. Department of Economics and Finance, Gulf University for Science and Technology, P.O. Box 7207, Hawally 32093, Kuwait;1. Computer Science Department, Federal University of Paraná (UFPR), Brazil. PO 19081, ZIP Code: 81531-970, Curitiba, Brazil;2. Intelligent Systems Group, Department of Computer Architecture and Technology, University of the Basque Country (UPV/EHU), Paseo Manuel de Lardizabal 1, 20080 San Sebastián, Guipúzcoa, Spain;3. Intelligent Systems Group, Department of Computer Science and Artificial Intelligence, University of the Basque Country (UPV/EHU), Paseo Manuel de Lardizabal 1, 20080 San Sebastián, Guipúzcoa, Spain;1. School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China;2. School of Information Science and Technology, Qingdao University of Science and Technology, Qingdao 266061, China;3. School of Computer Science, Liaocheng University, Liaocheng 252059, China;4. School of Mathematics and Statistics, Xian Jiaotong University, Xian 710049, China;1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China;2. Collaborative Innovation Center of Novel Software Technology and Industrialization, Nanjing, China |
| |
| Abstract: | This paper addresses a sub-population based hybrid monkey search algorithm to solve the flow shop scheduling problem which has been proved to be non-deterministic polynomial time hard (NP-hard) type combinatorial optimization problems. Minimization of makespan and total flow time are the objective functions considered. In the proposed algorithm, two different sub-populations for the two objectives are generated and different dispatching rules are used to improve the solution quality. To the best of our knowledge, this is the first application of monkey search algorithm to solve the flow shop scheduling problems. The performance of the proposed algorithm has been tested with the benchmark problems addressed in the literature. Computational results reveal that the proposed algorithm outperforms many other heuristics and meta-heuristics addressed in the literature. |
| |
| Keywords: | Flow shop Scheduling NP-hard Monkey search algorithm Makespan Total flow time |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
