Alireza Ghoonodi - Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran

This paper considers the scheduling problem of open shop to minimize makespan. Purpose of scheduling open shop problem is attaining to a suitable order of processing n jobs by m specified machines such that makespan be minimized. Open shop scheduling problem has very large and complex solution space and so is one of NP-Problems. Up till now, different algorithms have been presented for open shop scheduling problem. In this paper we use Genetic Algorithm (GA) as a strategy for solving the scheduling open shop problem and the results show better effectiveness in some instances of proposed algorithm compared with other algorithm

Open Shop, Genetics Algorithm, Scheduling, NP-Complete