An analogue genetic algorithm for solving job shop scheduling problems

Al-Hakim, Latif (2001) An analogue genetic algorithm for solving job shop scheduling problems. International Journal of Production Research, 39 (7). pp. 1537-1548. ISSN 0020-7543

[img]
Preview
Text
Al-Hakim_2001_Permanent_restriction.pdf

Download (31Kb)

Abstract

This paper develops a genetic algorithm for solving job shop scheduling problems. It discusses the difficulties arising from the traditional encoding of the problem and suggests a new encoding scheme. The paper also develops an analogue electrical system to represent the problem and uses the measure of that system to develop a new measure for the fitness function of the genetic algorithm. The algorithm considers the conventional genetic operations but with some modification. The computational results, developed for the makespan criterion, show that, for this criterion, the algorithm is reliable and performs relatively well.


Statistics for USQ ePrint 2874
Statistics for this ePrint Item
Item Type: Article (Commonwealth Reporting Category C)
Refereed: Yes
Item Status: Live Archive
Depositing User: Dr Latif Al-Hakim
Faculty / Department / School: Historic - Faculty of Business - Department of Management and Organisational Behaviour
Date Deposited: 11 Oct 2007 01:15
Last Modified: 28 Nov 2013 01:56
Uncontrolled Keywords: job shops, shop scheduling, analogue algorithms
Fields of Research (FOR2008): 09 Engineering > 0910 Manufacturing Engineering > 091099 Manufacturing Engineering not elsewhere classified
15 Commerce, Management, Tourism and Services > 1503 Business and Management > 150399 Business and Management not elsewhere classified
Identification Number or DOI: doi: 10.1080/00207540010023538
URI: http://eprints.usq.edu.au/id/eprint/2874

Actions (login required)

View Item Archive Repository Staff Only