Transportation Management College, Dalian Maritime University, Dalian, PR.China

---

Abstract—In this paper, we analyze the characteristics of the job shop scheduling problem. A new genetic algorithm for solving the agile job shop scheduling is presented to solve the job shop scheduling problem. Initial population is generated randomly. Two-row chromosome structure is adopted based on working procedure and machine distribution. The relevant crossover and mutation operation is also designed. It jumped from the local optimal solution, and the search area of solution is improved. Finally, the algorithm is tested on instances of 8 working procedure and 5 machines. The result shows that the genetic algorithm has been successfully applied to the job shop scheduling problems efficiency.

Index Terms—job shop scheduling, genetic algorithm, initial population, crossover and mutation operation.

[PDF]

Cite: Ye Li, Yan Chen, "A Genetic Algorithm for Job-Shop Scheduling," Journal of Software vol. 5, no. 3, pp. 269-274, 2010.