GA based heuristic for the open job shop scheduling problem
- 268 Downloads
Open job shop scheduling is a kind of job shop scheduling in which operations can be performed in any order. In this paper an attempt is made to develop a heuristic for the open job shop scheduling problem using genetic algorithm to minimize makespan. Genetic algorithm operators are suitably modified to maintain feasibility. The results are statistically compared and found to be significantly better than the earlier reported results.
KeywordsScheduling Open job shop Makespan Genetic algorithm
Unable to display preview. Download preview PDF.
- 2.Layzewicza JB, Pesch E (2003) Open shop scheduling problems with late work criteria. Discrete Appl Math 45–62Google Scholar
- 3.Panneerselvam (1999) Heuristic for moderated job shop scheduling problem to minimize makespan. Ind Eng J 3:26–27Google Scholar
- 4.Paul RT, Shahabudeen P (2004) Genetic algorithm for cost effective methods to reactor – generation system. Int J Adv Manuf Technol 23:846–856Google Scholar
- 6.Shahabudeen P, Krishnaiah K (1999) Design of bi-criteria Kanban system using genetic algorithm. Int J Manag Sys 15:257–274Google Scholar