Journal of Northeastern University ›› 2004, Vol. 25 ›› Issue (11): 1095-1098.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Optimized job shop scheduling based on genetic algorithm for discretely concurrent production

Cui, Hong-Wen (1); Sui, Tian-Zhong (1); Wang, Bin-Rui (1); Jin, Ying-Lian (1)   

  1. (1) Sch. of Mech. Eng. and Automat., Northeastern Univ., Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2004-11-15 Published:2013-06-24
  • Contact: Sui, T.-Z.
  • About author:-
  • Supported by:
    -

Abstract: By analyzing the scheduling process of discretely concurrent production in CIM system and based on the genetic algorithm, a mathematical model is developed with the intention of optimizing the job shop scheduling to minimize the time required for the whole manufacturing process, the crossover and variation operator of the genetic algorithm designed with the code and each and every integral parts are described in detail. The data base technology was used to develop a visual software for realizing genetic algorithm so as to implement the integration of the scheduling system with other CIMS modules in actual applications. The theoretic analysis and practice indicate that such a genetic algorithm is simple, clear, practical and effective, and the optimization sequencing solved via the algorithm can be taken as a guidance to job-shop scheduling for concurrent production.

CLC Number: