Volume 5 Number 3 (Mar. 2010)
Home > Archive > 2010 > Volume 5 Number 3 (Mar. 2010) >
JSW 2010 Vol.5(3): 269-274 ISSN: 1796-217X
doi: 10.4304/jsw.5.3.269-274

A Genetic Algorithm for Job-Shop Scheduling

Ye Li, Yan Chen

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.

General Information

  • ISSN: 1796-217X (Online)
  • Frequency:  Quarterly
  • Editor-in-Chief: Prof. Antanas Verikas
  • Executive Editor: Ms. Yoyo Y. Zhou
  • Abstracting/ Indexing: DBLP, EBSCO, CNKIGoogle Scholar, ProQuest, INSPEC(IET), ULRICH's Periodicals Directory, WorldCat, etc
  • E-mail: jsweditorialoffice@gmail.com
  • APC: 500USD
  • Jun 12, 2024 News!

    Vol 19, No 2 has been published with online version   [Click]

  • Jan 04, 2024 News!

    JSW will adopt Article-by-Article Work Flow

  • Apr 01, 2024 News!

    Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec)     [Click]

  • Apr 01, 2024 News!

    Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP   [Click]

  • Mar 01, 2024 News!

    Vol 19, No 1 has been published with online version    [Click]