A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop |
| |
Authors: | Seyed Morteza Goldansaz Fariborz JolaiAmir Hossein Zahedi Anaraki |
| |
Institution: | Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran |
| |
Abstract: | In this paper a new mixed-integer linear programming (MILP) model is proposed for the multi-processor open shop scheduling (MPOS) problems to minimize the makespan with considering independent setup time and sequence dependent removal time. A hybrid imperialist competitive algorithm (ICA) with genetic algorithm (GA) is presented to solve this problem. The parameters of the proposed algorithm are tuned by response surface methodology (RSM). The performance of the algorithm to solve small, medium and large sized instances of the problem is evaluated by introducing two performance metrics. The quality of obtained solutions is compared with that of the optimal solutions for small sized instances and with the lower bounds for medium sized instances. Also some computational results are presented for large sized instances. |
| |
Keywords: | Multi-processor open shop scheduling problems Makespan Imperialist competitive algorithm Genetic algorithm Response surface methodology |
本文献已被 ScienceDirect 等数据库收录! |