Abstract
We consider the problem of processing some identical jobs with a complicated technological route on some production line in presence of parallel machines. Under some constrains on the number of jobs processed simultaneously, a cyclic schedule is desired with minimum cycle duration. Some algorithm for construction of an exact solution is proposed and substantiated. Also, we found the case of pseudopolynomially solvable problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. A. Bobrova, A. A. Romanova, and V. V. Servakh, “The Complexity of Cyclic Scheduling for Identical Jobs,” Diskretn. Anal. Issled. Oper. 20 (4), 3–14 (2013).
A. A. Romanova and V. V. Servakh, “Optimization of Processing Identical Jobs by Means of Cyclic Schedules,” Diskretn. Anal. Issled. Oper. 15 (5), 47–60 (2008) [J. Appl. Indust. Math. 3 (4), 496–504 (2009)].
V. V. Servakh, “An Effectively Solvable Case of a Project Scheduling Problem with Renewable Resources,” Diskretn. Anal. Issled. Oper. Ser. 2, 7 (1), 75–82 (2000).
V. G. Timkovsky, “Approximate Solution of a Schedule Construction Problem for a Cyclic System,” Ekonom. Mat. Metody 22 (1), 171–174 (1986).
T. Boudoukh, M. Penn, and G. Weiss, “Job-Shop—an Application of Fluid Approximation,” in Proceedings of the 10th Conference on Industrial EngineeringManagement, Haifa, Israel, June 10–12, 1998 (Israel Inst. Technol., Haifa, 1998), pp. 254–258.
T. Boudoukh, M. Penn, and G. Weiss, “Scheduling Jobshops with Some Identical or Similar Jobs,” J. Sched. 4 (4), 177–199 (2001).
P. Brucker, Scheduling Algorithms (Springer, Berlin, 2007).
N. G. Hall, T. E. Lee, and M. E. Posner, “The Complexity of Cyclic Shop Scheduling Problems,” J. Sched. 5 (4), 307–327 (2002).
C. Hanen, “Study of a NP-Hard Cyclic Scheduling Problem: The Recurrent Job-Shop,” European J. Oper. Res. 72 (1), 82–101 (1994).
H. Kamoun and C. Sriskandarajah, “The Complexity of Scheduling Jobs in Repetitive Manufacturing Systems,” European J. Oper. Res. 70 (3), 350–364 (1993).
E. Levner, V. Kats, D. Pablo, and E. Cheng, “Complexity of Cyclic Scheduling Problems:A State-of-the-Art Survey,” Comput. Ind. Eng. 59 (2), 352–361 (2010).
S. T. McCormick and U. S. Rao, “Some Complexity Results in Cyclic Scheduling,” Math. Comput. Model. 20 (2), 107–122 (1994).
U. S. Rao and P. L. Jackson, “Subproblems in Identical Jobs Cyclic Scheduling: Properties, Complexity, and Solution Approaches,” Tech. Rep. (Cornell Univ., Ithaca, NY, USA, 1993). [Available at http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.3814. AccessedOct. 5, 2016].
R. Roundy, “Cyclic Schedules for Job Shops with Identical Jobs,” Math. Oper. Res. 17 (4), 842–865 (1992).
V. V. Servakh, “A Dynamic Algorithm for Some Project Management Problems,” in Proceedings of the International Workshop “Discrete Optimization Methods in Scheduling and Computer-Aided Design,” Minsk, Belarus, Sept. 5–6, 2000 (Inst. Eng. Cybern. NAS Belarus, Minsk, 2000), pp. 90–92.
V. G. Timkovsky, “Cycle Shop Scheduling,” in Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Ed. by J. Y.-T. Leung (Chapman & Hall/CRC, Boca Raton, London, 2004), pp. 127–148.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © E.A. Bobrova, V. V. Servakh, 2017, published in Diskretnyi Analiz i Issledovanie Operatsii, 2017, Vol. 24, No. 1, pp. 5–20.
Rights and permissions
About this article
Cite this article
Bobrova, E.A., Servakh, V.V. Construction of cyclic schedules in presence of parallel machines. J. Appl. Ind. Math. 11, 17–25 (2017). https://doi.org/10.1134/S1990478917010033
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478917010033