A neural network algorithm for servicing jobs with sequential and parallel machines
- 89 Downloads
We consider the FJ‖C max problem of optimal servicing with respect to performance for a given set of jobs by sequential and parallel machines. The problem FJ‖C max is a generalization of the classical J‖C 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 FJ‖C max On the first stage, we solve the problem J‖C 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 J‖C max and problem FJ‖C max was evaluated on 20 test examples obtained from 20 known J‖C max problems by including into the servicing system a random number of copies of sequential machines.
KeywordsSchedule Problem Remote Control Parallel Machine Priority Rule Heuristic Solution
Unable to display preview. Download preview PDF.
- 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
- 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
- 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.Muth, J.F. and Thompson, G.L., Industrial Scheduling, Englewood Cliffs: Prentice-Hall, 1963.Google Scholar
- 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
- 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
- 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
- 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.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