Journal of Scheduling

, Volume 13, Issue 1, pp 17–38 | Cite as

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

  • Shengxiang Yang
  • Dingwei Wang
  • Tianyou Chai
  • Graham Kendall
Article

Abstract

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.

Keywords

Job-shop scheduling Constraint satisfaction adaptive neural network Heuristics Active schedule Non-delay schedule Priority rule Computational complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akyol, D. E., & Bayhan, G. M. (2007). A review on evolution of production scheduling with neural networks. Computers & Industrial Engineering, 53(1), 95–122. CrossRefGoogle Scholar
  2. Baker, K. R. (1974). Introduction to sequence and scheduling. New York: Wiley. Google Scholar
  3. Bellman, R. E., Esogbue, A. O., & Nabeshima, I. (1982). Mathematical aspects of scheduling and applications. Oxford: Pergamon. Google Scholar
  4. Beasley, J. E. (1990). OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11), 1069–1072. CrossRefGoogle Scholar
  5. Bierwirth, C., & Mattfeld, D. C. (1999). Production scheduling and rescheduling with genetic algorithms. Evolutionary Computation, 7(1), 1–17. CrossRefGoogle Scholar
  6. Blackstone, J., Phillips, D., & Hogg, G. (1982). A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, 20, 27–45. CrossRefGoogle Scholar
  7. Cheng, R., Gen, M., & Tsujimura, Y. (1996). A tutorial survey of job-shop scheduling problems using genetic algorithms, I: representation. Computers & Industrial Engineering, 30(4), 983–997. CrossRefGoogle Scholar
  8. Cheng, R., Gen, M., & Tsujimura, Y. (1999). A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies. Computers & Industrial Engineering, 36(2), 343–364. CrossRefGoogle Scholar
  9. Conway, R. W., Maxwell, W. L., & Miller, L. W. (1967). Theory of scheduling. Reading: Addison-Wesley. Google Scholar
  10. Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1990). Introduction to algorithms. Cambridge: MIT Press. Google Scholar
  11. Dubois, D., Fargier, H., & Prade, H. (1995). Fuzzy constraints in job-shop scheduling. Journal of Intelligent Manufacturing, 6, 215–234. CrossRefGoogle Scholar
  12. Erschler, J., Roubellat, F., & Vernhes, J. P. (1976). Finding some essential characteristics of the feasible solutions for a scheduling problem. Operations Research, 24(4), 774–783. CrossRefGoogle Scholar
  13. Fang, H.-L., Ross, P., & Corne, D. (1993). A promising genetic algorithm approach to job-shop scheduling, rescheduling and open-shop scheduling problems. In Proceedings of the 5th international conference on genetic algorithms (pp. 375–382). Google Scholar
  14. Foo, S. Y., & Takefuji, Y. (1988a). Neural networks for solving job-shop scheduling, part 1: problem representation. In Proceedings of the 2nd IEEE international joint conference on neural networks (Vol. 2, pp. 275–282). Google Scholar
  15. Foo, S. Y., & Takefuji, Y. (1988b). Stochastic neural networks for solving job-shop scheduling, part 2: architecture and simulations. In Proceedings of the 2nd IEEE international joint conference on neural networks (Vol. 2, pp. 283–290). Google Scholar
  16. Foo, S. Y., Takefuji, Y., & Szu, H. (1994). Job-shop scheduling based on modified Tank–Hopfield linear programming networks. Engineering Application of Artificial Intelligence, 7(3), 321–327. CrossRefGoogle Scholar
  17. Fox, M. S., & Zweben, M. (1993). Knowledge-based scheduling. San Mateo: Morgan Kaufmann. Google Scholar
  18. French, S. (1982). Sequencing and scheduling: an introduction to the mathematics of the job-shop. New York: Wiley. Google Scholar
  19. Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and job-shop scheduling. Mathematics of Operations Research, 1(2), 117–129. CrossRefGoogle Scholar
  20. Giffler, B., & Thompson, G. (1960). Algorithms for solving production scheduling problems. Operations Research, 8, 487–503. CrossRefGoogle Scholar
  21. Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 4, 287–326. CrossRefGoogle Scholar
  22. Graves, S. C. (1981). A review of production scheduling. Operations Research, 29(24), 646–675. CrossRefGoogle Scholar
  23. Hart, E., & Ross, P. (1998). A heuristic combination method for solving job-shop scheduling problems. In Lecture notes in computer science : Vol. 1498. Proceedings of the 5th international conference on parallel problem solving from nature (PPSN V) (pp. 845–854). Berlin: Springer. CrossRefGoogle Scholar
  24. Hart, E., Ross, P., & Corne, D. (2005). Evolutionary scheduling: a review. Genetic Programming and Evolvable Machines, 6, 191–220. CrossRefGoogle Scholar
  25. Haupt, R. (1989). A survey of priority-rule based scheduling problem. OR Spektrum, 11, 3–16. CrossRefGoogle Scholar
  26. Haykin, S. (1999). Neural networks a comprehensive foundation (2nd ed.). London: Prentice Hall International. Google Scholar
  27. Hentenryck, P. V. (1989). Constraint satisfaction and logic programming. Cambridge: MIT Press. Google Scholar
  28. Lawrence, S. (1984). Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA. Google Scholar
  29. Lin, S.-C., Goodman, E. D., & Punch, W. F. (1997). A genetic algorithm approach to dynamic job-shop scheduling problems. In Proceedings of the 7th international conference on genetic algorithms (pp. 481–489). Google Scholar
  30. Luh, P. B., Zhao, X., Wang, Y., & Thakur, L. S. (2000). Lagrangian relaxation neural networks for job shop scheduling. IEEE Transactions on Robotics and Automation, 16(1), 78–88. CrossRefGoogle Scholar
  31. Vázquez, M., & Whitley, L. D. (2000a). A comparison of genetic algorithms for the static job shop scheduling problem. In Proceedings of the 6th international conference on parallel problem solving from nature (PPSN VI) (pp. 303–312). Google Scholar
  32. Vázquez, M., & Whitley, L. D. (2000b). A comparison of genetic algorithms for the dynamic job shop scheduling problem. In Proceedings of the 2000 genetic and evolutionary computation conference (pp. 1011–1018). Google Scholar
  33. Willems, T. M. (1994). Neural networks for job-shop scheduling. Control Engineering Practice, 2(1), 31–39. CrossRefGoogle Scholar
  34. Willems, T. M., & Brandts, L. E. M. W. (1995). Implementing heuristics as an optimization criterion in neural networks for job-shop scheduling. Journal of Intelligent Manufacturing, 6, 377–387. CrossRefGoogle Scholar
  35. Yang, S. (2005). An improved adaptive neural network for job-shop scheduling. In Proceedings of the 2005 IEEE international conference on systems, man and cybernetics (Vol. 2, pp. 1200–1205). Google Scholar
  36. Yang, S. (2006). Job-shop scheduling with an adaptive neural network and local search hybrid approach. In Proceedings of the 2006 IEEE international joint conference on neural networks (pp. 2720–2727). Google Scholar
  37. Yang, S., & Wang, D. (2000). Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling. IEEE Transactions on Neural Networks, 11(2), 474–486. CrossRefGoogle Scholar
  38. Yang, S., & Wang, D. (2001). A new adaptive neural network and heuristics hybrid approach for job-shop scheduling. Computers & Operations Research, 28(10), 955–971. CrossRefGoogle Scholar
  39. Yu, H. (1997). Research of intelligent production scheduling methods and their applications. PhD thesis, Northeastern University, China. Google Scholar
  40. Yu, H., & Liang, W. (2001). Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling. Computers & Industrial Engineering, 39, 337–356. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Shengxiang Yang
    • 1
  • Dingwei Wang
    • 2
  • Tianyou Chai
    • 2
  • Graham Kendall
    • 3
  1. 1.Department of Computer ScienceUniversity of LeicesterLeicesterUK
  2. 2.Key Laboratory of Integrated Automation of Process Industry (Northeastern University), Ministry of EducationNortheastern UniversityShenyangChina
  3. 3.School of Computer ScienceUniversity of NottinghamNottinghamUK

Personalised recommendations