Skip to main content

Advertisement

SpringerLink
Log in

Enhancement of performance of Genetic Algorithm for job shop scheduling problems through inversion operator

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

It is observed that the optimization technique Genetic Algorithm is gaining more importance over the past several years. With high computing power we are able to apply soft computing techniques to solve complex problems in less time. An approach through Genetic Algorithm to solve job shop scheduling problems using inversion operator has been tried, with make-span objective. Computational experiments of this attempt have shown better solutions coupled with appreciable reduction in computer processing time. A set of 20 selected benchmark problems were tried with the proposed heuristic for validation and the results are encouraging. The inversion operator is found to perform better.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Franch S (1981) Sequencing and scheduling – an introduction to the mathematics of the job-shop. Wiley, New York

    Google Scholar 

  2. Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York

    Google Scholar 

  3. Pinedo M, Chao X (1999) Operation scheduling with applications in manufacturing and services. McGraw-Hill, Boston

    Google Scholar 

  4. Nakano R, Yamada T (1991) Conventional genetic algorithms for job-shop problems. In: Belew RK, Booker LB (eds) Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, pp 477–479

    Google Scholar 

  5. Yamada T, Nakano R (1992) A genetic algorithm applicable to large-scale job shop problems. In: Manner R, Manderick B (eds) Parallel problem solving from nature: PPSN II, Elsevier Science, North-Holland, pp 281–290

    Google Scholar 

  6. Fang H, Ross P, Corne D (1993) A promising genetic algorithm approach to job shop scheduling, rescheduling and open shop scheduling. In: Forrest S (ed) Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, pp 375–382

    Google Scholar 

  7. Gen M, Tsujimura J, Kubota E (1994) Solving job-shop scheduling problem using genetic algorithms. In: Gen M, Kobayashi S (eds) Proceedings of the 16th International Conference on Computers and Industrial Engineering, Ashikaga, Japan, pp 576–579

    Google Scholar 

  8. Ferreira C (2002) Combinatorial Optimization by Gene expression programming: Inversion revisited. Argentine Symposium on Artificial Intelligence, pp 160–174

  9. Shubhra Sankar Ray, Sanghamitra Bandyopadhyay, Sankar K. Pal (2004) New operators of Genetic Algorithms for Traveling Salesman Problem. IEEE Int. Conf. on Pattern Recognition (ICPR 04) pp 497–500

  10. Filho JLR, Treleaven PC (1994) Genetic algorithm programming environments. IEEE Comput 27(6):28–43

    Google Scholar 

  11. Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, New York

    Google Scholar 

  12. Bierwirth C (1995) A generalized permutation approach to job shop scheduling with genetic algorithm. OR Spectrum 17:87–92

    MATH  Google Scholar 

  13. Mattfeld DC (1996) Evolutionary search and the job shop: investigations on genetic algorithms for production scheduling. Physica-Verlag, Heidelberg, Germany

    MATH  Google Scholar 

  14. Ponnambalam SG, Aravindan P, Sreenivasa Rao P (2001) Comparative evaluation of genetic algorithms for job-hop scheduling. Prod Plan Control 12(6):560–574

    Article  Google Scholar 

  15. Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI, USA

  16. Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. In: Muth JF, Thompson GL (eds) Industrial scheduling. Prentice-Hall, Englewood Cliffs, NJ, USA, pp 225–251

    Google Scholar 

  17. Adams J, Balas E, Zawak D (1988) The shifting bottle-neck procedure for job-shop scheduling. Manage Sci 34(3):391–401

    Article  MATH  Google Scholar 

  18. Applegate D, Cook W (1991) A computational study of the job-shop scheduling problems. ORSA-J Comput 3:149–156

    MATH  Google Scholar 

  19. Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Technical report, Graduate School of Industrial Administration, Carnegie Melon University, USA

  20. Beasley JE (1990) OR-Library. http://mscmga.ms.ic.ac.uk/info.html. Cited 20 November 2004

Download references

Acknowledgements

Thanks are due to Dr. C. Rajendran, Professor, Department of Humanities and Social sciences, Indian Institute of Technology, Chennai, India for useful suggestions that helped improve the paper.

Author information

Authors and Affiliations

  1. Mechanical Engineering, Government College of Technology, Coimbatore, India

    K. S. Amirthagadeswaran & V. P. Arunachalam

Authors
  1. K. S. Amirthagadeswaran
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. P. Arunachalam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. S. Amirthagadeswaran.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Amirthagadeswaran, K.S., Arunachalam, V.P. Enhancement of performance of Genetic Algorithm for job shop scheduling problems through inversion operator. Int J Adv Manuf Technol 32, 780–786 (2007). https://doi.org/10.1007/s00170-005-0392-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-005-0392-3

Keywords

Search

Navigation