An improved constraint satisfaction adaptive neural network for job-shop scheduling

This paper presents an improved constraint satisfaction adaptive neural network for job-shop scheduling problems. The neural network is constructed based on the constraint conditions of a job-shop scheduling problem. Its structure and neuron connections can change adaptively according to the real-time constraint satisfaction situations that arise during the solving process. Several heuristics are also integrated within the neural network to enhance its convergence, accelerate its convergence, and improve the quality of the solutions produced. An experimental study based on a set of benchmark job-shop scheduling problems shows that the improved constraint satisfaction adaptive neural network outperforms the original constraint satisfaction adaptive neural network in terms of computational time and the quality of schedules it produces. The neural network approach is also experimentally validated to outperform three classical heuristic algorithms that are widely used as the basis of many state-of-the-art scheduling systems. Hence, it may also be used to construct advanced job-shop scheduling systems.

[1]  J. Nazuno.  Haykin, Simon. Neural networks: A comprehensive foundation, Prentice Hall, Inc. Segunda Edición, 1999 , 2000 .

[2]  Shengxiang Yang,et al.  Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling , 2000, IEEE Trans. Neural Networks Learn. Syst..

[3]  L. Darrell Whitley,et al.  A Comparison of Genetic Algorithms for the Static Job Shop Scheduling Problem , 2000, PPSN.

[4]  Shengxiang Yang.  An Improved Adaptive Neural Network for Job-Shop Scheduling , 2005, 2005 IEEE International Conference on Systems, Man and Cybernetics.

[5]  Erik D. Goodman,et al.  A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problem , 1997, ICGA.

[6]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[7]  Peter Ross,et al.  Evolutionary Scheduling: A Review , 2005, Genetic Programming and Evolvable Machines.

[8]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[9]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[10]  Yoshiyasu Takefuji,et al.  Job-shop scheduling based on modified tank-hopfield linear programming networks , 1994 .

[11]  Yoshiyasu Takefuji,et al.  JOB-SHOP SCHEDULING , 1996 .

[12]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[13]  Shengxiang Yang.  Job-Shop Scheduling with an Adaptive Neural Network and Local Search Hybrid Approach , 2006, The 2006 IEEE International Joint Conference on Neural Network Proceedings.

[14]  J. Erschler,et al.  Technical Note - Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem , 1976, Oper. Res..

[15]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[16]  K. Kandt.  Knowledge-based scheduling , 1990, 1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings.

[17]  W. Punch,et al.  A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problems , 1997 .

[18]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[19]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[20]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[21]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[22]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[23]  Yoshiyasu Takefuji,et al.  Stochastic neural networks for solving job-shop scheduling. I. Problem representation , 1988, IEEE 1988 International Conference on Neural Networks.

[24]  Shengxiang Yang,et al.  A new adaptive neural network and heuristics hybrid approach for job-shop scheduling , 2001, Comput. Oper. Res..

[25]  Yoshiyasu Takefuji,et al.  Stochastic neural networks for solving job-shop scheduling. II. architecture and simulations , 1988, IEEE 1988 International Conference on Neural Networks.

[26]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

[27]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[28]  Pascal Van Hentenryck.  Parallel Constraint Satisfaction in Logic Programming: Preliminary Results of CHIP within PEPSys , 1989, ICLP.

[29]  T. M. Willems,et al.  Implementing heuristics as an optimization criterion in neural networks for job-shop scheduling , 1995, J. Intell. Manuf..

[30]  Simon Haykin,et al.  Neural Networks: A Comprehensive Foundation , 1998 .

[31]  Peter Ross,et al.  A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems , 1993, ICGA.

[32]  Peter B. Luh,et al.  Lagrangian relaxation neural networks for job shop scheduling , 2000, IEEE Trans. Robotics Autom..

[33]  Didier Dubois,et al.  Fuzzy constraints in job-shop scheduling , 1995, J. Intell. Manuf..

[34]  Richard Bellman,et al.  Mathematical Aspects Of Scheduling And Applications , 1982 .

[35]  Jacobus E. Rooda,et al.  NEURAL NETWORKS FOR JOB-SHOP SCHEDULING , 1994 .

[36]  Derya Eren Akyol,et al.  A review on evolution of production scheduling with neural networks , 2007, Comput. Ind. Eng..

[37]  Christian Bierwirth,et al.  Production Scheduling and Rescheduling with Genetic Algorithms , 1999, Evolutionary Computation.

[38]  Peter Ross,et al.  A Heuristic Combination Method for Solving Job-Shop Scheduling Problems , 1998, PPSN.

[39]  Haibin Yu,et al.  Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling , 2001 .

[40]  Stephen C. Graves,et al.  A Review of Production Scheduling , 1981, Oper. Res..