article

Survey: Complexity of cyclic scheduling problems: A state-of-the-art survey

Authors:

David Alcaide López de Pablo,

T. C. E. ChengAuthors Info & Claims

Computers and Industrial Engineering, Volume 59, Issue 2

Pages 352 - 361

https://doi.org/10.1016/j.cie.2010.03.013

Published: 01 September 2010 Publication History

Abstract

In this survey we review the current complexity status of basic cyclic scheduling models. We start with the formulations of three fundamental cyclic scheduling problems, namely the cyclic jobshop, cyclic flowshop, and cyclic project scheduling problems. We present state-of-the-art results on the computational complexity of the problems, paying special attention to recent results on the unsolvability (NP-hardness) of various cyclic problems arising from the scheduling of robotic cells.

References

[1]

Scheduling no-wait robotic cells with two and three machines. European Journal of Operational Research. v123. 303-314.

[2]

Part sequencing in three-machine no-wait robotic cells. Operations Research Letters. v27 i4. 185-192.

[3]

Multi-operator cyclic processes. Doklady of the Byelorussian Academy of Sciences. v7 i4. 224-227.

[4]

Robotic cell scheduling with operational flexibility. Discrete Applied Mathematics. v145. 334-348.

[5]

Cyclic multiple-robot scheduling with time-window constraints using a critical path approach. European Journal of Operational Research. v177. 147-162.

[6]

Synchronization and linearity. Wiley, New York.

[7]

A critical review on the design and retrofit of batch plants. Computers and Chemical Engineering. v31. 833-855.

[8]

A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Operations Research. v29 i3. 501-510.

[9]

Handbook of scheduling theory. Springer, Berlin.

[10]

Identical part production in cyclic robotic cells: Concepts, overview and open questions. Discrete Applied Mathematics. v156. 2480-2492.

Digital Library

[11]

Brauner, N., Finke, G., & Kubiak, W. (1997). A proof of the Lei and Wang claim. Technical note, Laboratoire Leibnitz, Institute IMAG, Grenoble.

[12]

Scheduling algorithms. Springer, Berlin.

[13]

Complexity results for parallel machine problems with a single server. Journal of Scheduling. v5. 429-457.

[14]

Tabu search algorithms for cyclic machine scheduling problems. Journal of Scheduling. v8 i4. 303-322.

[15]

The state of the art of nurse rostering. Journal of Scheduling. v7 i6. 441-499.

[16]

Les Probl'emes d'ordonnancement. Masson, Paris.

[17]

Simultaneous batching and scheduling of single stage batch plants with parallel units. AIChE Journal. v54 i1. 183-193.

[18]

A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line. Operations Research Letters. v33. 274-284.

[19]

Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots. European Journal of Operational Research. v199. 77-88.

[20]

Multicyclic hoist scheduling with constant processing times. IEEE Transactions on Robotics and Automation. v18 i1. 69-80.

[21]

A polynomial algorithm for 2-degree cyclic robot scheduling. European Journal of Operational Research. v145 i1. 31-44.

[22]

Cyclic scheduling of a hoist with time window constraints. IEEE Transactions on Robotics and Automation. v14. 144-152.

[23]

A review of flowshop scheduling research with setup times. Production and Operations Management. v9 i3. 262-282.

[24]

The basic cyclic scheduling problem with deadline. Discrete Applied Mathematics. v30. 109-123.

[25]

A faster polynomial algorithm for 2-cyclic robotic scheduling. Journal of Scheduling. v9. 453-468.

[26]

A linear system theoretic view of discrete event processes and its use for performance evaluation in manufacturing. IEEE Transactions on Automatic Control. v30 i1. 210-220.

[27]

Crama, Y., & van de Klundert, J. (1997). Robotic flowshop scheduling is strongly NP-complete. In Klein Haneveld, W. K. (Ed.), Ten years LNMB. CWI Tract, Amsterdam, pp. 277-286.

[28]

Cyclic scheduling in robotic flowshops. Annals of Operations Research. v96. 97-124.

[29]

Describing industrial processes with interference and approximating their steady-state behaviour. Operational Research Quarterly. v13 i1. 95-100.

[30]

Minimax algebra. Springer-Verlag, Berlin.

[31]

On cyclic sequence types for constructing cyclic schedule. Zeitschrift fur Operations Research. v29. 1-30.

[32]

Throughput optimization in dual-gripper interval robotic cells. IIE Transactions. v42 i1. 1-15.

[33]

Sequencing and scheduling in robotic cells: Recent developments. Journal of Scheduling. v8 i5. 387-426.

[34]

Throughput optimization in robotic cells. Springer, Berlin.

[35]

Scheduling dual gripper robotic cell: One-unit cycles. European Journal of Operational Research. v171. 598-631.

[36]

Continuous-time versus discrete time approaches for scheduling of chemical processes: A review. Computers and Chemical Engineering. v28. 2109-2129.

[37]

Optimal buffer allocation in asynchronous cyclic mixed-model assembly lines. Production and Operations Management. v7 i3. 294-311.

[38]

Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, San Francisco.

[39]

Periodic transportation schedules with flexible departure times. European Journal of Operational Research. v50. 298-309.

[40]

Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics. v5. 287-326.

[41]

Scheduling of re-entrant flow shops. Journal of Operations Management. v3. 197-207.

[42]

Review of non-linear mixed-integer and disjunctive programming techniques for process systems engineering. Journal of Optimization and Engineering. v3. 227-252.

[43]

Bicriteria robotic operation allocation in a flexible manufacturing cell. Computers and Operations Research. v37 i4. 779-789.

[44]

Operations research techniques for robotic system planning, design, control and analysis. In: Nof, S.Y. (Ed.), Handbook of industrial robotics, vol. II. John Wiley, New York. pp. 543-577.

[45]

Scheduling in robotic cells: Complexity and steady state analysis. European Journal of Operational Research. v109. 43-65.

[46]

The complexity of cyclic shop scheduling problems. Journal of Scheduling. v5. 307-327.

[47]

Parallel machine scheduling with a common server. Discrete Applied Mathematics. v102. 223-243.

[48]

Study of a NP-hard cyclic scheduling problem: The recurrent job-shop. European Journal of Operational Research. v72. 82-101.

[49]

Cyclic scheduling on parallel processors: An overview. In: Chretienne, P., Coffman, E.G., Lenstra, J.K., Liu, Z. (Eds.), Scheduling theory and its applications, Wiley, New York. pp. 194-226.

[50]

A study of the cyclic scheduling problem on parallel processors. Discrete Applied Mathematics. v57. 167-192.

[51]

Periodic schedules for linear precedence constraints. Discrete Applied Mathematics. v157. 280-291.

[52]

A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem. Computers & Industrial Engineering. v47 i1. 91-101.

[53]

Hitz, K. L. (1980). Scheduling of flow shops II. Report no. LIDS-R-879, Laboratory for Information and Decision Systems, MIT, Cambridge, Massachusetts.

[54]

On the general feasibility test of scheduling lot sizes for several products on one machine. Management Science. v29. 93-103.

[55]

Cyclic scheduling for FMS: Modelling and evolutionary solving approach. European Journal of Operational Research. v191. 464-484.

[56]

A tabu search algorithm for scheduling a single robot in a job-shop environment. Discrete Applied Mathematics. v119. 181-203.

[57]

Schedule efficiency in a robotic production cell. International Journal of Flexible Manufacturing Systems. v7. 5-26.

[58]

Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times. Computers & Operations Research. v35. 827-844.

[59]

The complexity of scheduling jobs in repetitive manufacturing systems. European Journal of Operational Research. v70. 350-364.

[60]

Kampmeyer, T. (2006). Cyclic scheduling problems. PhD Thesis, University of Osnabrück, Germany.

[61]

Cyclic scheduling in flow lines: Modelling, observations, effective heuristics and a cycle time minimization procedure. Naval Research Logistics. v43. 211-231.

[62]

Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (Eds.), Complexity of computer computations, Plenum Press, New York. pp. 85-100.

[63]

Minimal quantity of operators for serving a homogeneous linear technological process. Automation and Remote Control. v39 i3. 445-450.

[64]

An exact optimal cyclic scheduling algorithm for multioperator service of a production line. Automation and Remote Control. v422. 538-543.

[65]

Kats, V., & Levner, E. (2010). A fast algorithm for a cyclic scheduling problem with interval data. In Proceedings of the annual operations research society of Israel (ORSIS-2010) conference, February 2010, Nir Etzion, Israel.

[66]

Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence and time-window constraints. European Journal of Operational Research. v187 i3. 1196-1211.

[67]

A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling. Operations Research Letters. v21. 171-179.

[68]

Minimizing the number of robots to meet a given cyclic schedule. Annals of Operations Research. v69. 209-226.

[69]

Cyclic scheduling of operations for a part type in an FMS handled by a single robot: A parametric critical-path approach. International Journal of Flexible Manufacturing Systems. v10. 129-138.

[70]

Cyclic scheduling in a robotic production line. Journal of Scheduling. v5. 23-41.

[71]

Polynomial algorithms for periodic scheduling of tasks on parallel processors. In: Yang, L.T., Paprzycki, M. (Eds.), Practical applications of parallel computing: Advances in computation theory and practice, vol. 12. Nova Science Publishers, Canada. pp. 363-370.

[72]

. In: Gelbukh, Reyes-García, (Eds.), in LNAI, vol. 4293. Springer Verlag. pp. 439-449.

[73]

A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case. Discrete Applied Mathematics. v157. 339-355.

[74]

Multiple-part cyclic hoist scheduling using a sieve method. IEEE Transactions on Robotics and Automation. v15 i4. 704-713.

[75]

Exact solution of a cyclic scheduling problem. Automation and Remote Control. v4. 187-190.

[76]

On an automated two-machine flowshop scheduling problem with infinite buffer. Journal of the Operations Research Society of Japan. v34 i3. 354-361.

[77]

Automated two-machine flowshop scheduling: A solvable case. IIE Transactions. v23 i1. 10-16.

[78]

Cyclic scheduling in synchronous production lines. IIE Transactions. v31 i8. 709-719.

[79]

Chromatic scheduling in a cyclic open shop. European Journal of Operational Research. v164. 585-591.

[80]

Solution of the Liu-Layland problem via bottleneck just-in-time sequencing. Journal of Scheduling. v8 i4. 295-302.

[81]

Stable earliest starting schedules for cyclic job shops: A linear system approach. International Journal of Flexible Manufacturing Systems. v12. 59-80.

[82]

Modelling and scheduling of ratio-driven FMS using unfolding time Petri nets. Computers & Industrial Engineering. v46 i4. 639-653.

[83]

Current trends in deterministic scheduling. Annals of Operations Research. v70. 1-41.

[84]

Performance measures and schedules in periodic job shops. Operations Research. v45 i1. 72-91.

[85]

Determining the optimal starting times in a cyclic schedule with a given route. Computers & Operations Research. v20. 807-816.

[86]

Lei, L., & Wang, T. J. (1989). A proof: The cyclic scheduling problem is NP-complete. Working paper no. 89-0016, Rutgers University, New Jersey.

[87]

Optimal cyclic scheduling of a robotic processing line with two-product and time-window constraints. INFOR. v39 i2. 185-199.

[88]

Handbook of scheduling: Algorithms, models, and performance analysis. Chapman & Hall/CRC, Boca Raton.

[89]

An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times. Operations Research Letters. v34. 465-472.

[90]

Optimal planning of parts machining on a number of machines. Automation and Remote Control. v12. 1972-1981.

[91]

Levner, E., Che, A., & Kats, V. (2009). Risk-conscious scheduling of robotic cells with bounded work-in-process in stochastic environment. In Proceedings of the IASTED international conference on modeling, simulation and identification (MSI 2009) October 2009, Beijing, China, pp. 164-169.

[92]

A parametrical critical path problem and an application for cyclic scheduling. Discrete Applied Mathematics. v87. 149-158.

[93]

Cyclic scheduling in robotic cells: An extension of basic models in machine scheduling problems. In: Levner, E. (Ed.), Multiprocessor scheduling, theory and applications, I-Tech. Publishers, Vienna, Austria. pp. 1-20.

[94]

An improved algorithm for cyclic flowshop scheduling in a robotic cell. European Journal of Operational Research. v197. 500-508.

[95]

An efficient optimal solution to the two-hoist no-wait cyclic scheduling problem. Operations Research. v53 i2. 313-327.

[96]

A scheduling problem in an automated flow line with an automated operator. Computational Mathematics and Computerized Systems. v5. 151-155.

[97]

A classification for hoist scheduling problems. International Journal of Flexible Manufacturing Systems. v15. 37-55.

[98]

Integration of production planning and scheduling: Overview, challenges and opportunities. Computers and Chemical Engineering. v33. 1919-1930.

[99]

Cyclic sequencing problems in the two-machine permutation flowshop: Complexity, worst case and average case analysis. Naval Research Logistics. v37. 679-694.

[100]

A crane scheduling problem in a computer-integrated manufacturing environment. Management Science. v17. 587-606.

[101]

Throughput-optimal sequences for cyclically operated plants. Discrete Event Dynamical Systems. v18. 355-383.

[102]

McCormick, S. T., Pinedo, M. L., & Wolf, B. (1987). The complexity of scheduling a flexible assembly system. Working paper, University of British Columbia, Vancouver, British Columbia, Canada.

[103]

Sequencing in an assembly line with blocking to minimize cycle time. Operations Research. v37. 925-935.

[104]

Sequencing in a flexible assembly line with blocking to minimize cycle time. In: Stecke, K.E., Suri, R. (Eds.), Flexible manufacturing systems, Elsevier, Amsterdam.

[105]

Some complexity results in cyclic scheduling. Mathematical and Computer Modelling. v20. 107-122.

[106]

State-of-the-art review of optimization methods for short-term scheduling of batch processes. Computers and Chemical Engineering. v30. 913-946.

[107]

The complexity of a cyclic scheduling problem with identical machines and precedence constraints. European Journal of Operational Research. v91. 471-480.

[108]

Determining the optimal move times for a given cyclic schedule of a material handling hoist. Computers & Industrial Engineering. v32 i3. 595-606.

[109]

Orlin, J. B. (1985). The complexity of dynamic/periodic languages and optimization problems. Sloan working paper no. 1679-85, Sloan School of Management, MIT, <http://dspace.mit.edu/bitstream/1721.1/2112/1/SWP-1679-12684447.pdf>.

[110]

Pantelides, C. C. (1994). Unified frameworks for optimal process planning and scheduling, In Rippin, D. W. T. & Hale, J. (Eds.), Foundations of computer-aided process operations, New York, pp. 253-274.

[111]

Mathematical programming solution of a hoist scheduling program. AIIE Transactions. v8 i2. 219-225.

[112]

Planning and scheduling in manufacturing and services. Springer, New York.

[113]

Scheduling: Theory, algorithms and systems. Springer, New York.

[114]

Optimal design and retrofit of batch plants with a periodic mode of operation. Computers and Chemical Engineering. v29. 1293-1303.

[115]

Assignments and sequencing models of the scheduling of process systems. Annals of Operations Research. v81. 433-466.

[116]

Optimization of stationary control of a discrete deterministic process. Kybernetika (Cybernetics). v3 i2. 66-78.

[117]

Cyclic nurse scheduling. European Journal of Operational Research. v31. 19-23.

[118]

Cyclic schedules for job-shops with identical jobs. Mathematics of Operations Research. v17. 842-865.

[119]

A quadratic algorithm for the 2-cyclic robotic scheduling problem. Theoretical Computer Science. v410. 973-976.

[120]

Steady-state analysis and scheduling of cycle job shops with overtaking. International Journal of Flexible Manufacturing Systems. v14. 291-318.

[121]

A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics. v2. 550-581.

[122]

Sequencing of parts and robot moves in a robotic cell. International Journal of Flexible Manufacturing Systems. v4. 331-358.

[123]

Petri net modeling and scheduling for cyclic job shops with blocking. Computers & Industrial Engineering. v34 i2. 281-295.

[124]

Scheduling in re-entrant robotic cells: Algorithms and complexity. Journal of Scheduling. v8. 25-48.

[125]

Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times. Mathematical and Computer Modelling. v47. 925-942.

[126]

A multistage technological process. Doklady Academy Nauk BSSR. v6 i9. 522-541.

[127]

A scheduling problem for a flowshop line with a single operator. Engineering Physical Journal. v7 i3. 111-114.

[128]

A cyclic approach to large-scale short-term planning in chemical batch production. Journal of Scheduling. v12. 595-606.

[129]

Compact cylindrical chromatic scheduling. SIAM Journal on Discrete Mathematics. v4. 528-534.

[130]

Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation. Computers and Chemical Engineering. v28. 2271-2286.

Cited By

Schulz ATelha C(2024)Integer FactorizationOperations Research10.1287/opre.2022.239072:3(1192-1202)Online publication date: 1-May-2024
https://dl.acm.org/doi/10.1287/opre.2022.2390
Guiraud MStrozecki Y(2024)Scheduling periodic messages on a shared link without bufferingJournal of Scheduling10.1007/s10951-024-00813-027:5(461-484)Online publication date: 16-Jul-2024
https://dl.acm.org/doi/10.1007/s10951-024-00813-0
Zorzenon DKomenda JRaisch J(2024)Switched max-plus linear-dual inequalities: cycle time analysis and applicationsDiscrete Event Dynamic Systems10.1007/s10626-023-00389-534:1(199-250)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s10626-023-00389-5
Show More Cited By

Survey: Complexity of cyclic scheduling problems: A state-of-the-art survey

Recommendations

A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case

In this paper we consider the problem of no-wait cyclic scheduling of identical parts in an m-machine production line in which a robot is responsible for moving each part from a machine to another. The aim is to find the minimum cycle time for the so-...
On connection between reducibility of an n-ary quasigroup and that of its retracts

An n-ary operation Q:@S^n->@S is called an n-ary quasigroup of order |@S| if in the equation x"0=Q(x"1,...,x"n) knowledge of any n elements of x"0,...,x"n uniquely specifies the remaining one. An n-ary quasigroup Q is (permutably) reducible if Q(x"1,...,...
A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem

Recently, Pablo Saez (2009) [1] has developed a quadratic algorithm for a 2-cyclic robotic scheduling problem. In this note we uncover that the algorithm handles a special version of the problem only and fails to solve the general 2-cyclic robotic ...

Comments

Information & Contributors

Information

Published In

cover image Computers and Industrial Engineering

Computers and Industrial Engineering Volume 59, Issue 2

September, 2010

184 pages

ISSN:0360-8352

Issue’s Table of Contents

Copyright © Elsevier Ltd © 2010.

Publisher

Pergamon Press, Inc.

United States

Publication History

Published: 01 September 2010

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Schulz ATelha C(2024)Integer FactorizationOperations Research10.1287/opre.2022.239072:3(1192-1202)Online publication date: 1-May-2024
https://dl.acm.org/doi/10.1287/opre.2022.2390
Guiraud MStrozecki Y(2024)Scheduling periodic messages on a shared link without bufferingJournal of Scheduling10.1007/s10951-024-00813-027:5(461-484)Online publication date: 16-Jul-2024
https://dl.acm.org/doi/10.1007/s10951-024-00813-0
Zorzenon DKomenda JRaisch J(2024)Switched max-plus linear-dual inequalities: cycle time analysis and applicationsDiscrete Event Dynamic Systems10.1007/s10626-023-00389-534:1(199-250)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s10626-023-00389-5
Hu RWu XQian BMao JJin H(2022)Differential Evolution Algorithm Combined with Uncertainty Handling Techniques for Stochastic Reentrant Job Shop Scheduling ProblemComplexity10.1155/2022/99241632022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/9924163
Dawande MFeng ZJanakiraman G(2021)On the Structure of Bottlenecks in ProcessesManagement Science10.1287/mnsc.2020.370467:6(3853-3870)Online publication date: 1-Jun-2021
https://dl.acm.org/doi/10.1287/mnsc.2020.3704
Bo YDawande MHuh WJanakiraman GNagarajan M(2019)Determining Process CapacityManufacturing & Service Operations Management10.1287/msom.2017.068921:1(139-153)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1287/msom.2017.0689
Hegyháti MŐsz OHatwágner M(2018)A Study on Solving Single Stage Batch Process Scheduling Problems with an Evolutionary Algorithm Featuring Bacterial MutationsArtificial Intelligence and Soft Computing10.1007/978-3-319-91253-0_36(386-394)Online publication date: 3-Jun-2018
https://dl.acm.org/doi/10.1007/978-3-319-91253-0_36
Ding JL ZCheng TXu L(2017)A hybrid evolutionary approach for the single-machine total weighted tardiness problemComputers and Industrial Engineering10.1016/j.cie.2017.04.006108:C(70-80)Online publication date: 1-Jun-2017
https://dl.acm.org/doi/10.1016/j.cie.2017.04.006
Yan PWang GChe ALi Y(2016)Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentranceComputers and Operations Research10.1016/j.cor.2016.06.01176:C(155-166)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1016/j.cor.2016.06.011
Ding JLü ZCheng TXu L(2016)Breakout dynasearch for the single-machine total weighted tardiness problemComputers and Industrial Engineering10.1016/j.cie.2016.04.02298:C(1-10)Online publication date: 1-Aug-2016
https://dl.acm.org/doi/10.1016/j.cie.2016.04.022
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents