Editorial Board
Publishing Ethics
Author Guide
Submission Prepare Your ManuscriptPeer review
Archive
English version:
Journal of Applied and Industrial Mathematics, 2019, 13:4, 706-716
Volume 26, No 4, 2019, P. 56-73
UDC 519.8
A. A. Romanova and V. V. Servakh
Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints
Abstract:
We consider the cyclic job shop problem with no-wait constraints which consists in minimizing the cycle time. We assume that a single product is produced on a few machines. A job is processed by performing a given set of operations in a predetermined sequence. Each operation can be performed on exactly one machine. We consider the problem of minimization the cycle time with no-wait constraints between some pairs of sequential operations and investigate the complexity of the problem and some of its subproblems. In general, the problem is proved to be strongly NP-hard. In the case when the job is processed without downtime between operations, polynomial solvability is proved and the two algorithms are proposed. Also we develop an algorithm for the general case which is pseudopolynomial if the number of admissible downtime is fixed. The case of a single no-wait constraint is polynomially solvable. The problem with two no-wait constraints becomes NP-hard. We found effectively solvable cases and propose the corresponding algorithms.
Illustr. 4, bibliogr. 14.
Keywords: scheduling theory, cyclic job shop, identical jobs, computational complexity theory, polynomial algorithm, pseudopolynomial algorithm.
DOI: 10.33048/daio.2019.26.629
Anna A. Romanova 1
Vladimir V. Servakh 2
1. Omsk State University,
55a Mir Avenue, 644077 Omsk, Russia
2. Omsk Branch of Sobolev Institute of Mathematics,
13 Pevtsov Street, 644099 Omsk, Russia
e-mail: anna.a.r@bk.ru, svv_usa@rambler.ru
Received August 27, 2018
Revised July 29, 2019
Accepted August 28, 2019
References
[1] E. A. Bobrova, A. A. Romanova, V. V. Servakh, The complexity of the cyclic job shop problem with identical jobs, Diskretn. Anal. Issled. Oper. 20 (4), 3–14 (2013) [Russian].[2] A. A. Romanova and V. V. Servakh, Optimization of identical jobs production on the base of cyclic schedules, Diskretn. Anal. Issled. Oper. 15 (4), 47–60 (2008) [Russian].
[3] N. G. Hall, T. E. Lee, and M. E. Posner, The complexity of cyclic shop scheduling problems, J. Sched. 5 (4), 307–327 (2002).
[4] C. Hanen, Study of an NP-hard cyclic scheduling problem: The recurrent job-shop, Eur. J. Oper. Res. 71, 82–101 (1994).
[5] S. T. McCormick and U. S. Rao, Some complexity results in cyclic scheduling, Math. Comput. Modelling 20, 107–122 (1994).
[6] M. Middendorf and V. Timkovsky, On scheduling cycle shops: Classification, complexity, and approximation, J. Sched. 5 (2), 135–169 (2002).
[7] R. Roundy, Cyclic schedules for job shops with identical jobs, Math. Oper. Res. 17 (4), 842–865 (1995).
[8] K. A. Aldakhilallah and R. Ramesh, Cyclic scheduling heuristics for a reentrant job shop manufacturing environment, Int. J. Prod. Res. 39, 2635–2675 (2001).
[9] T. Boudoukh, M. Penn, and G. Weiss, Scheduling job shops with some identical or similar jobs, J. Sched. 4, 177–199 (2001).
[10] P. Brucker and T. Kampmeyer, Tabu search algorithms for cyclic machine scheduling problems, J. Sched. 8, 303–322 (2005).
[11] M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979; Mir, Moscow, 1982 [Russian]).
[12] V. Kats and E. Levner, Cyclic scheduling in a robotic production line, J. Sched. 5 (1), 23–41 (2002).
[13] V. S. Aizenshtat, Multi-operator cyclic processes, Dokl. Nats. Akad. Nauk Belarus 7 (4), 224–227 (1963) [Russian].
[14] V. S. Tanaev, A scheduling problem for a flowshop line with a single operator, Inzh.-Fiz. Zh. 7 (3), 111–114 (1964) [Russian].
