Abstract
Some cyclic job shop problems with identical jobs are under study. Using dynamic programming, we propose an algorithm for solving one of these problems exactly. In the special case of a fixed number of jobs which can be processed simultaneously, we construct a fully polynomial time approximation scheme.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. V. Gens and E. V. Levner, Efficient Approximation Algorithms for Combinatorial Problems, Preprint (Central Econom. Math. Inst., Moscow, 1981).
V. V. Servakh, “An Effectively Solvable Case of a Project Scheduling Problem With Renewable Resources,” Diskret. Anal. Issled. Oper. Ser. 2, 7(1), 75–82 (2000).
K. A. Aldakhilallah and R. Ramesh, “Cyclic Scheduling Heuristics for a Re-Entrant Job Shop Manufacturing Environment,” Internat. J. Production Res. 39, 2635–2675 (2001).
S. E. Akers, “A Graphical Approach to Production Scheduling Problems,” Oper. Res. 4(2), 244–245 (1956).
T. Boudoukh, M. Penn, and G. Weiss, “Scheduling Job Shops with Some Identical or Similar Jobs,” J. Scheduling. 4, 177–199 (2001).
P. Brucker and T. Kampmeyer, Tabu Search Algorithms for Cyclic Machine Scheduling Problems, Preprint (Osnabrueck, 2002).
N. G. Hall, T. E. Lee, and M. E. Posner, “The Complexity of Cyclic Shop Scheduling Problems,” J. Scheduling 5, 307–327 (2002).
C. Hanen, “Study of an NP-Hard Cyclic Scheduling Problem: the Recurrent Job-Shop,” European J. Oper. Res. 71, 82–101 (1994).
W. W. Hardgrave and G. L. Nemhauser, “A Geometric Model and a Graphical Algorithm for a Sequencing Problem,” Oper. Res. 11(6), 889–900 (1963).
O. H. Ibarra and C. E. Kim, “Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems,” J. ACM 22(4), 463–468 (1975).
H. Kamoun and C. Sriskandarajah, “The Complexity of Scheduling Jobs in Repetitive Manufacturing Systems,” European J. Oper. Res. 70, 350–364 (1993).
T. Lee and M. Posner, “Performance Measure and Schedules in Periodic Job Shop,” Oper. Res. 45, 72–91 (1997).
S. T. McCormick and U. S. Rao, “Some Complexity Results in Cyclic Scheduling,” Math. and Comput. Modelling 20, 107–122 (1994).
U. Rao and P. Jackson, Identical Jobs Cyclic Scheduling: Subproblems, Properties, Complexity and Solution Approaches (Cornell Univ. Press, Ithaca, NY, 1993).
A. A. Romanova and V. V. Servakh, “On Some Cyclic Machine Scheduling Problem,” in Abstracts of the XVII European Conference of Combinatorial Optimization (ECCO’2005) (United Institute of Informatics Problems of the Belarus National Academy of Sciences, Minsk, 2005), pp. 58–59.
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” (Institute of Engineering Cybernetics of the Belarus National Academy of Sciences, Minsk, 2005), pp. 90–92.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.A. Romanova, V.V. Servakh, 2008, published in Diskretnyi Analiz i Issledovanie Operatsii, 2008, Vol. 15, No. 5, pp. 47–60.
Rights and permissions
About this article
Cite this article
Romanova, A.A., Servakh, V.V. Optimization of processing identical jobs by means of cyclic schedules. J. Appl. Ind. Math. 3, 496–504 (2009). https://doi.org/10.1134/S1990478909040085
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478909040085