Solving job shop scheduling problem using genetic algorithm with penalty function
Article
Sun, L., Cheng, X. and Liang, Y. 2010. Solving job shop scheduling problem using genetic algorithm with penalty function. International Journal of Intelligent Information Processing. 1 (2), pp. 65-77.
Type | Article |
---|---|
Title | Solving job shop scheduling problem using genetic algorithm with penalty function |
Authors | Sun, L., Cheng, X. and Liang, Y. |
Abstract | This paper presents a genetic algorithm with a penalty function for the job shop scheduling problem. In the context of proposed algorithm, a clonal selection based hyper mutation and a life span extended strategy is designed. During the search process, an adaptive penalty function is designed so that the algorithm can search in both feasible and infeasible regions of the solution space. Simulated experiments were conducted on 23 benchmark instances taken from the OR-library. The results show the effectiveness of the proposed algorithm. |
Research Group | Artificial Intelligence group |
Publisher | Human and Sciences Publication |
Journal | International Journal of Intelligent Information Processing |
ISSN | 2093-1964 |
Publication dates | |
Dec 2010 | |
Publication process dates | |
Deposited | 26 Apr 2011 |
Output status | Published |
Publisher's version | |
Copyright Statement | We acknowledge permission from IJIIP for hosting published work. (5/11) |
Language | English |
Permalink -
https://repository.mdx.ac.uk/item/8350y
Download files
48
total views20
total downloads1
views this month1
downloads this month