Skip to main content

Advertisement

Log in

A neural network job-shop scheduler

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

This paper focuses on the development of a neural network (NN) scheduler for scheduling job-shops. In this hybrid intelligent system, genetic algorithms (GA) are used to generate optimal schedules to a known benchmark problem. In each optimal solution, every individually scheduled operation of a job is treated as a decision which contains knowledge. Each decision is modeled as a function of a set of job characteristics (e.g., processing time), which are divided into classes using domain knowledge from common dispatching rules (e.g., shortest processing time). A NN is used to capture the predictive knowledge regarding the assignment of operation’s position in a sequence. The trained NN could successfully replicate the performance of the GA on the benchmark problem. The developed NN scheduler was then tested against the GA, Attribute-Oriented Induction data mining methodology and common dispatching rules on a test set of randomly generated problems. The better performance of the NN scheduler on the test problem set compared to other methods proves the feasibility of NN-based scheduling. The scalability of the NN scheduler on larger problem sizes was also found to be satisfactory in replicating the performance of the GA.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Adams J., Balas E., Zawack D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science 34(3): 391–401

    Google Scholar 

  • Agarwal A., Colak S., Eryarsoy E. (2006). Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach. European Journal of Operational Research 169(3): 801–815

    Article  Google Scholar 

  • Baker K.R. (1974). Introduction to sequencing and scheduling. New York, Wiley

    Google Scholar 

  • Blackstone J.H., Jr., Phillips D.T., Hogg G.L. (1982). A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research 20(1): 27

    Article  Google Scholar 

  • Cheung J.Y. (1994). Scheduling. In: Dagli C.H. (ed) Artificial neural networks for intelligent manufacturing (1st ed). London New York, Chapman & Hall, pp. 469

    Google Scholar 

  • Dagli C.H., Sittisathanchai S. (1995). Genetic neuro-scheduler: A new approach for job shop scheduling. International Journal of Production Economics 41(1–3): 135–145

    Article  Google Scholar 

  • Dietterich, T. (1996). Machine learning. ACM Computing Surveys (CSUR), 28(4es), 3-es.

  • Fisher H., Thompson G.L. (1963). Probabilistic learning combinations of local job-shop scheduling rules. In: Muth J.F., Thompson G.L. (eds) Industrial scheduling. Englewood Cliffs New Jersy, Prentice Hall, pp. 225–251

    Google Scholar 

  • Fonseca D.J., Navaresse D. (2002). Artificial neural networks for job shop simulation. Advanced Engineering Informatics 16(4): 241–246

    Article  Google Scholar 

  • Foo, Y. S., & Takefuji, T. (1988). Integer linear programming neural networks for job-shop scheduling. IEEE International Conference on Neural Networks, San Diego, California, July 24–27 (Vol. 2, pp. 341–348).

  • Foo S.Y., Takefuji Y., Szu H. (1995). Scaling properties of neural networks for job-shop scheduling. Neurocomputing 8(1): 79–91

    Article  Google Scholar 

  • French S. (1982). Sequencing and scheduling: An introduction to the mathematics of the job-shop. Chichester, West Sussex: E. Horwood

    Google Scholar 

  • Giffler B., Thompson G.L. (1960). Algorithms for solving production-scheduling problems. Operations Research 8(4): 487–503

    Article  Google Scholar 

  • Jain, A. S., & Meeran, S. (1996). Scheduling a job-shop using a modified back-error propagation neural network. Paper presented at the Proceedings of the IMS’96 First Symposium on Intelligent Manufacturing Systems Conference, Adapazari, Turkey, May 30–31 (pp. 462–474).

  • Jain A.S., Meeran S. (1998). Job-shop scheduling using neural networks. International Journal of Production Research 36(5): 1249–1272

    Article  Google Scholar 

  • Käschel, J., Teich, T., Köbernik, G., & Meier, B. (1999). Algorithms for the job shop scheduling problem: A comparison of different methods. In European Symposium on Intelligent Techniques, Greece (pp. 3–4).

  • Koonce D.A., Tsai S.-C. (2000). Using data mining to find patterns in genetic algorithm solutions to a job shop schedule. Computers and Industrial Engineering 38(3): 361–374

    Article  Google Scholar 

  • Lawrence, S. (1984). Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques (supplement). Pittsburgh, PA: Graduate School of Industrial Administration, Carnegie-Mellon University.

  • Mitchell T.M. (1997). Machine learning. New York, McGraw-Hill

    Google Scholar 

  • Príncipe J.C., Euliano N.R., Lefebvre W.C. (2000). Neural and adaptive systems: Fundamentals through simulations. New York, Wiley

    Google Scholar 

  • Rabelo, L. C., & Alptekin, S. (1989). Using hybrid neural networks/expert systems for intelligent scheduling in flexible manufacturing systems. In IJCNN: International Joint Conference on Neural Networks, June 18–22, Washington (Vol. 2, 608 pp).

  • Rumelhart D.E., Hinton G.E., Williams R.J. (1986). Learning representations by back-propagating errors. Nature 323: 533–536

    Article  Google Scholar 

  • Shah, N., & Koonce, D. A. (2004). Using distributed genetic algorithms for solving job shop scheduling problems. In Proceedings of the IIE 2004 Annual Conference, Houston, TX.

  • Sormaz, D. N. (2003). Application of space search tools in intelligent manufacturing planning. In Industrial Engineering Research Conference, May 18–20, Portland, OR.

  • Turban E., Aronson J.E. (2001). Decision support systems and intelligent systems (6th ed). Upper Saddle River, NJ, Prentice Hall

    Google Scholar 

  • Widrow B., Rumelhart D.E., Lehr M.A. (1994). Neural networks: Applications in industry, business and science. Communications of the ACM 37(3): 93–105

    Article  Google Scholar 

  • Yamada T., Nakano R. (1992). A genetic algorithm applicable to large-scale job-shop instances. In: Manner R., Manderick B. (eds) Parallel instance solving from nature 2. Amsterdam, North-Holland, pp. 281–290

    Google Scholar 

  • Yamada, T., & Nakano, R. (1997). Job-shop scheduling. In A. M. S. Zalzala & P. J. Fleming (Eds.), Genetic algorithms in engineering systems (pp. 134–160). The Institution of Electrical Engineers.

  • 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

    Article  Google Scholar 

  • Yu H., Liang W. (2001). Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling. Computers and Industrial Engineering 39(3–4): 337–356

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gary R. Weckman.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Weckman, G.R., Ganduri, C.V. & Koonce, D.A. A neural network job-shop scheduler. J Intell Manuf 19, 191–201 (2008). https://doi.org/10.1007/s10845-008-0073-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-008-0073-9

Keywords

Navigation