Automation and Remote Control

, Volume 75, Issue 7, pp 1203–1220 | Cite as

A neural network algorithm for servicing jobs with sequential and parallel machines

  • O. GholamiEmail author
  • Yu. N. Sotskov
Topical Issue


We consider the FJC max problem of optimal servicing with respect to performance for a given set of jobs by sequential and parallel machines. The problem FJC max is a generalization of the classical JC max problem for the case when the servicing system has not only sequential but also parallel (identical) machines. We propose a two-stage algorithm for a heuristic solution of problem FJC max On the first stage, we solve the problem JC max, i.e., we assume that the servicing system does not have parallel machines. On the second stage, operations are distributed over parallel machines. On both stages of the algorithm, we use neural network decision making models. The efficiency of a neural network algorithm for the problem JC max and problem FJC max was evaluated on 20 test examples obtained from 20 known JC max problems by including into the servicing system a random number of copies of sequential machines.


Schedule Problem Remote Control Parallel Machine Priority Rule Heuristic Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Brucker, P., Sotskov, Y.N., and Werner, F., Complexity of Shop-Scheduling Problems with Fixed Number of Jobs: A Survey, Math. Method. Oper. Res., 2007, vol. 65, pp. 461–481.MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Garey, E.L., Johnson, D.S., and Sethi, R., The Complexity of Flow-Shop and Job-Shop Scheduling, Math. Oper. Res., 1976, vol. 1, pp. 117–129.MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Graham, R.L., Lawler, E.L., Lenstra, J.K., et al., Optimization and Approximation in Deterministic Sequencing and Scheduling. A Survey, Ann. Discr. Math., 1976, vol. 5, pp. 287–326.MathSciNetCrossRefGoogle Scholar
  4. 4.
    Tanaev, V.S., Sotskov, Y.N., and Strusevich, V.A., Scheduling Theory. Multi-Stage Systems, Dordrecht: Kluwer, 1994.CrossRefzbMATHGoogle Scholar
  5. 5.
    Sotskov, Y.N. and Shakhlevich, N.V., NP-Hardness of Shop-Scheduling Problems with Three Jobs, Discr. Appl. Math., 1995, vol. 59, pp. 237–266.MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Paulli, J., A Hierarchical Approach for the FMS Scheduling Problem, Eur. J. Oper. Res., 1995, vol. 86, no. 1, pp. 32–42.CrossRefzbMATHGoogle Scholar
  7. 7.
    Wang, S. and Yu, J., An Effective Heuristic for Flexible Job-Shop Scheduling Problem with Maintenance Activities, Comput. Ind. Eng., 2010, vol. 59, no. 3, pp. 436–447.CrossRefGoogle Scholar
  8. 8.
    Fattahi, P., Mehrabad, M.S., and Jolai, F., Mathematical Modeling and Heuristic Approaches to Flexible Job Shop Scheduling Problem, J. Intelligent Manuf., 2007, vol. 18, no. 3, pp. 331–342.CrossRefGoogle Scholar
  9. 9.
    Gao, J., Sun, L., and Gen, M., A Hybrid Genetic and Variable Neighborhood Descent Algorithm for Flexible Job Shop Scheduling Problems, Comput. Oper. Res., 2008, vol. 35, no. 9, pp. 2892–2907.MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Chiang, T.-C. and Lin, H.-J., A Simple and Effective Evolutionary Algorithm for Multi Objective Flexible Job-Shop Scheduling, Int. J. Prod. Econ., 2012, vol. 141, no. 1, pp. 87–98.CrossRefGoogle Scholar
  11. 11.
    Motaghedi-Larijani, A., Sabri-Laghaie, K., and Heydari, M., Solving Flexible Job Shop Scheduling with Multi Objective Approach, Int. J. Ind. Eng. Prod. Res., 2010, vol. 21, no. 4, pp. 197–209.Google Scholar
  12. 12.
    Zhang, G., Gao, L., and Shi, Y., An Effective Genetic Algorithm for the Flexible Job-Shop Scheduling Problem, Expert Sys. Appl., 2011, vol. 38, no. 4, pp. 3563–3573.CrossRefGoogle Scholar
  13. 13.
    Rossi, A. and Boschi, E., A Hybrid Heuristic to Solve the Parallel Machines Job-Shop Scheduling Problem, Adv. Eng. Software, 2009, vol. 40, no. 2, pp. 118–127.CrossRefzbMATHGoogle Scholar
  14. 14.
    Al-Hinai, N. and ElMekkawy, T.Y., Robust and Stable Flexible Job Shop Scheduling with Random Machine Breakdowns Using a Hybrid Genetic Algorithm, Int. J. Prod. Econ., 2011, vol. 132, no. 2, pp. 279–291.CrossRefGoogle Scholar
  15. 15.
    Xing, L.-N., Chen, Y.-W., and Yang, K.-W., Multi-Objective Flexible Job Shop Schedule: Design and Evaluation by Simulation Modelling, Appl. Soft Comput., 2009, vol. 9, no. 1, pp. 362–376.CrossRefGoogle Scholar
  16. 16.
    Hmidaa, A.B., Haouarid, V., Hugueta, M.-J., et al., Discrepancy Search for the Flexible Job Shop Scheduling Problem, Comput. Oper. Res., 2010, vol. 37, no. 12, pp. 2192–2201.MathSciNetCrossRefGoogle Scholar
  17. 17.
    Russell, I., Markov, Z., and Zlatareva, N., Introducing Machine Learning from an AI Perspective, Proc. 13 Int. Conf. Artific. Neural Networks (ICANN-03), Istanbul, Turkey, June 2003.Google Scholar
  18. 18.
    Mouelhi,-Chibani W. and Pierreval, H., Training a Neural Network to Select Dispatching Rules in Real Time, Comput. Ind. Eng., 2010, vol. 58, pp. 249–256.CrossRefGoogle Scholar
  19. 19.
    Xu, X., Guan, Q., Wang, W., and Chen, S., Transient Chaotic Discrete Neural Network for Flexible Job-Shop Scheduling, Lecture Notes Comput. Sci., 2005, vol. 3496, pp. 762–769.CrossRefGoogle Scholar
  20. 20.
    Zhou, D., Cherkassky, V., Baldwin, T., and Olson, D., A Neural Network Approach to Job-Shop Scheduling, IEEE Trans. Neural Network, 1991, vol. 2, no. 1, pp. 175–184.CrossRefGoogle Scholar
  21. 21.
    Weckman, G., Ganduri, C., and Koonce, D., A Neural Network Job-Shop Scheduler, J. Intelligent Manuf., 2008, vol. 19, no. 2, pp. 191–201.CrossRefGoogle Scholar
  22. 22.
    Gholami, O., Sotskov, Y.N., and Werner, F., Fast Edge-Orientation Heuristics for Job Shop Scheduling Problems with Applications to Train Scheduling, Int. J. Oper. Res. Nepal (IJORN), 2013, vol. 2, no. 1, pp. 19–32.Google Scholar
  23. 23.
    Muth, J.F. and Thompson, G.L., Industrial Scheduling, Englewood Cliffs: Prentice-Hall, 1963.Google Scholar
  24. 24.
    Gholami, O., Sotskov, Y.N., and Werner, F., Job-Shop Problems with Objectives Appropriate to Train Scheduling in a Single-Track Railway, in SIMULTECH 2012 Proc. 2 Int. Conf. Simulat. Model. Method. Technol. Appl., Roma, Italy, May 21, 2012, pp. 425–430.Google Scholar
  25. 25.
    Krüger, K., Sotskov, Y.N., and Werner, F., Heuristic for Generalized Shop Scheduling Problems Based on Decomposition, Int. J. Prod. Res., 1998, vol. 36, no. 11, pp. 3013–3033.CrossRefzbMATHGoogle Scholar
  26. 26.
    Shakhlevich, N.V., Sotskov, Y.N., and Werner, F., Adaptive Scheduling Algorithm Based on Mixed Graph Model, IEEE Proc. Control Theory Appl., 1996, vol. 143, no. 1, pp. 9–16.CrossRefzbMATHGoogle Scholar
  27. 27.
    Sotskov, Y.N., Gholami, O., and Werner, F., Solving a Job-Shop Scheduling Problem by an Adaptive Algorithm Based on Learning, Proc. 2013 IFAC Conf. Manufacturing Modelling, Management, and Control, St. Petersburg, Russia, June 19–21, 2013, pp. 1368–1372.Google Scholar
  28. 28.
    Dijkstra, E.W., A Note on Two Problems in Connection with Graphs, Numer. Math., 1959, vol. 1, pp. 269–271.MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    Sotskov, Yu.N. and Tanaev, V.S., Constructing Schedules Admissible with respect to a Mixed Multigraph, Izv. Akad. Nauk BSSR, Ser. Fiz.-Mat. Nauk, 1989, no. 4, pp. 94–98.Google Scholar
  30. 30.
    Panwalkar, S.S. and Iskander, W., A Survey of Scheduling Rules, Oper. Res., 1977, vol. 25, no. 1, pp. 45–61.MathSciNetCrossRefzbMATHGoogle Scholar
  31. 31.
    Lawrence, S., Supplement to Resource Constrained Project Scheduling: an Experimental Investigation of Heuristic Scheduling Techniques, PhD Thesis, Graduate School Industr. Administrat., Carnegie-Mellon University, Pittsburgh, USA, 1984.Google Scholar
  32. 32.
    Gholami, O. and Sotskov, Y.N., Scheduling Algorithm with Controllable Train Speeds and Departure Times to Decrease the Total Train Tardiness, Int. J. Ind. Eng. Comput., 2014, vol. 5, no. 2, pp. 1–14.Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2014

Authors and Affiliations

  1. 1.Department of Computer Science, Nour Department, Mahmudabad CenterIslam University of AzadMahmudabadIran
  2. 2.United Institute of Informatics ProblemsNational Academy of Sciences of BelarusMinskBelarus

Personalised recommendations