Abstract
An operation template is proposed in this paper for describing the mapping between operations and a subset of natural numbers. With such operation template, a job shop scheduling problem (JSSP) can be transformed into a traveling salesman problem (TSP), hence the integer-coding genetic algorithm for TSP can be easily applied and modified. A decoding strategy, called virtual job shop, is proposed to evaluate the fitness of the individual in GA population. The integration of the operation template and virtual job shop makes the existing integer-coding GA possible for solving an extension of a classical job shop scheduling problem. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Wu, C., Xiang, W., Liang, Y., Lee, H. P., & Zhou, C. (2004). A modified integer-coding genetic algorithm for job shop scheduling problem. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3157, pp. 373–380). Springer Verlag. https://doi.org/10.1007/978-3-540-28633-2_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
