Research on job-shop scheduling problem based on genetic algorithm

With job-shop scheduling (JSS) it is usually difficult to achieve the optimal solution with classical methods due to a high computational complexity (NP-hard). According to the nature of JSS, an improved definition of the JSS problem is presented and a JSS model based on a novel algorithm is established through the analysis of working procedure, working data, precedence constraints, processing performance index, JSS algorithm and so on. A decode select string (DSS) decoding genetic algorithm based on operation coding modes, which includes assembly problems, is proposed. The designed DSS decoding genetic algorithm (GA) can avoid the appearance of infeasible solutions through comparing current genes with DSS in the decoding procedure to obtain working procedure which can be decoded. Finally, the effectiveness and superiority of the proposed method is clarified compared to the classical JSS methods through the simulation experiments and the benchmark problem.

[1]  Latif Al-Hakim,et al.  An analogue genetic algorithm for solving job shop scheduling problems , 2001 .

[2]  F. Fnaiech,et al.  Recent Trends in Intelligent Job Shop Scheduling , 2006, 2006 1ST IEEE International Conference on E-Learning in Industrial Electronics.

[3]  Masatoshi Sakawa,et al.  Two‐objective fuzzy job shop scheduling through genetic algorithm , 2001 .

[4]  Cui Jing-wei Study of scheduling of dual-resource constrained job shop , 2007 .

[5]  T. C. Wong,et al.  A genetic algorithm-based approach to machine assignment problem , 2005 .

[6]  Liu Yongxian,et al.  Research on job-shop scheduling optimization method with limited resources , 2008 .

[7]  Wang Wan-liang A New Method Solving Job Shop Scheduling Problems Based On Hopfield Neural Networks , 2001 .

[8]  Liang Gao,et al.  Variable Neighborhood Genetic Algorithm for the Flexible Job Shop Scheduling Problems , 2008, ICIRA.

[9]  Ling Wang,et al.  A Modified Genetic Algorithm for Job Shop Scheduling , 2002 .

[10]  I. Moon,et al.  Genetic algorithms for job shop scheduling problems with alternative routings , 2008 .

[11]  Yunlong Zhu,et al.  Fuzzy Programming for Multiobjective Fuzzy Job Shop Scheduling with Alternative Machines Through Genetic Algorithms , 2005, ICNC.

[12]  P. Shahabudeen,et al.  GA based heuristic for the open job shop scheduling problem , 2006 .

[13]  C.K. Wong,et al.  Fast parallel heuristics for the job shop scheduling problem , 2002, Comput. Oper. Res..

[14]  George-Christopher Vosniakos,et al.  Transfer batch scheduling using genetic algorithms , 2008 .

[15]  J. Christopher Beck Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling , 2007, J. Artif. Intell. Res..

[16]  G. Gary Wang,et al.  Simultaneous optimization of fixture and joint positions for non-rigid sheet metal assembly , 2008 .

[17]  M. Sakawa,et al.  An efficient genetic algorithm for job-shop scheduling problems with fuzzy processing time and fuzzy duedate , 1999 .

[18]  Chung Yee Lee,et al.  Job shop scheduling with a genetic algorithm and machine learning , 1997 .

[19]  Hong Li Yin,et al.  A two-stage genetic algorithm for large size job shop scheduling problems , 2008 .

[20]  Shinichi Tagawa A new concept of job shop scheduling system — hierarchical decision model , 1996 .

[21]  Ping-Feng Pai,et al.  Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem , 2008 .