Abstract
Job shop scheduling problems are one of the challenging combinatorial problems that have drawn the attention of researchers for the last three decades. It is observed that genetic algorithm (GA) is gaining more importance over the past several years. An attempt has been made through GA to solve job shop scheduling problems with job-based, operation-based, and proposed methods of representation and schedule deduction with the make-span objective. Computational experiments of this attempt have yielded better solutions coupled with appreciable reduction in computer processing time. A set of selected benchmark problems have been used with the proposed heuristic for validation and the results show the better performance of the proposed method of representation of jobs and schedule deduction.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, New York
Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York
Pinedo M, Chao X (1999) Operation scheduling with applications in manufacturing and services. McGraw-Hill, Boston
Goldberg DE (1989) Genetic algorithm in search, optimization, and machine learning. Addison-Wesley, Boston
Cheng R (1996) A tutorial survey of job-shop scheduling problems using genetic algorithm I: representation. J Comput Ind Eng 30(4):983–987
Panneerselvamn E (2001) Production and operations management. Prentice-Hall, New Delhi
Filho JLR, Treleaven PC (1994) Genetic algorithm programming environments. IEEE Comput 27(6):28–43
Beasley JE (1990) OR-Library. http://mscmga.ms.ic.ac.uk/info.html. Cited 1 July 2004
Ponnambalam SG, Aravindan P, Sreenivasa Rao P (2001) Comparative evaluation of genetic algorithms for job shop scheduling. Prod Plan Control 12(6):560–574
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Amirthagadeswaran, K., Arunachalam, V. Improved solutions for job shop scheduling problems through genetic algorithm with a different method of schedule deduction. Int J Adv Manuf Technol 28, 532–540 (2006). https://doi.org/10.1007/s00170-004-2403-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-004-2403-1