Advertisement

GA based heuristic for the open job shop scheduling problem

  • P. SenthilkumarEmail author
  • P. Shahabudeen
Original Article

Abstract

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.

Keywords

Scheduling Open job shop Makespan Genetic algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Liaw C-F (2003) An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. Comput Oper Res 30:2081–2095zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Layzewicza JB, Pesch E (2003) Open shop scheduling problems with late work criteria. Discrete Appl Math 45–62Google Scholar
  3. 3.
    Panneerselvam (1999) Heuristic for moderated job shop scheduling problem to minimize makespan. Ind Eng J 3:26–27Google Scholar
  4. 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
  5. 5.
    Schuurman P, Woeginger GJ (1999) Approximation algorithms for the multiprocessor open shop scheduling problem. Oper Res Lett 24:157–163zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Shahabudeen P, Krishnaiah K (1999) Design of bi-criteria Kanban system using genetic algorithm. Int J Manag Sys 15:257–274Google Scholar
  7. 7.
    Strusevich VA, Hall LA (1997) An open shop scheduling problem with a non-bottleneck machine. Oper Res Lett 21:11–18zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Tsutomu K, Hiroaki I (2000) An open shop scheduling problem with fuzzy allowable time and fuzzy resource constraint. Fuzzy Sets Syst 109:141–147CrossRefGoogle Scholar
  9. 9.
    Werra D (1991) A preemptive open shop scheduling problem with one resource. Oper Res Lett 10:9–15zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2006

Authors and Affiliations

  1. 1.Lucas TVS LtdPondicherryIndia
  2. 2.Department of Industrial EngineeringAnna UniversityChennaiIndia

Personalised recommendations