Abstract
This paper addresses the Basic Cyclic Scheduling Problem where the processing times are affected by uncertainties. We formulate the problem as a two-stage robust optimization problem with a budgeted uncertainty set. More precisely, we consider the uncertainty set introduced by Bertsimas and Sim (Oper Res 52(1):35–53, 2004) where the activity durations are subject to interval uncertainty and the level of robustness is controlled by a parameter. We propose three exact algorithms for solving the problem. Two of them use a negative circuit detection algorithm as a subroutine, and the last one is a Howard’s algorithm adaptation. Results of numerical experiments on randomly generated instances show that the Howard’s algorithm adaptation yields efficient results and opens perspectives on more difficult robust cyclic scheduling problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahuja RK (2017) Network flows: theory, algorithms, and applications, Pearson Education
Ayala M, Benabid A, Artigues C, Hanen C (2013) The resource-constrained modulo scheduling problem: an experimental study. Comput Optim Appl 54(3):645–673
Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math Program 99(2):351–376
Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1):35–53
Brucker P, Kampmeyer T (2008) A general model for cyclic machine scheduling problems. Discrete Appl Math 156(13):2561–2572
Cavory G, Dupas R, Goncalves G (2005) A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints. Eur J Oper Res 161(1):73–85
Che A, Feng J, Chen H, Chu C (2015) Robust optimization for the cyclic hoist scheduling problem. Eur J Oper Res 240(3):627–636
Chen H, Chu C, Proth J-M (1998) Cyclic scheduling of a hoist with time window constraints. IEEE Trans Robot Autom 14(1):144–152
Cherkassky BV, Goldberg AV (1999) Negative-cycle detection algorithms. Math Program 85(2):277–311
Chretienne P (1991) The basic cyclic scheduling problem with deadlines. Discrete Appl Math 30(2–3):109–123
Cochet-Terrasson J, Cohen G, Gaubert S, McGettrick M, Quadrat J-P (1998) Numerical computation of spectral elements in max-plus algebra. In: Proceedings of the IFAC conference on system structure and control, Nantes
Cordeiro D, Mounié G, Perarnau S, Trystram D, Vincent J-M, Wagner F (2010) Random graph generation for scheduling simulations. In: Proceedings of the 3rd international ICST conference on simulation tools and techniques. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), p 60
Dasdan A (2004) Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM Trans Des Autom Electron Syst TODAES 9(4):385–418
Dasdan A, Irani SS, Gupta RK (1998) An experimental study of minimum mean cycle algorithms. Technical report, 98-32, University of California, Irvine
Dawande MW, Geismar HN, Sethi SP, Sriskandarajah C (2007) Throughput optimization in robotic cells, vol 101. Springer, New York
Gabrel V, Lacroix M, Murat C, Remli N (2014) Robust location transportation problems under uncertain demands. Discrete Appl Math 164:100–111
Gondran M, Minoux M (1984) Graphs and algorithms. Wiley, New York
Govindarajan R, Altman ER, Gao GR (1996) A framework for resource-constrained rate-optimal software pipelining. IEEE Trans Parallel Distrib Syst 7(11):1133–1149
Hanen C (1994) Study of a NP-hard cyclic scheduling problem: the recurrent job-shop. Eur J Oper Res 72(1):82–101
Hanen C, Munier A (1995) Cyclic scheduling on parallel processors: an overview. In: Chrétienne P, Coffman EG, Lenstra JK, Liu Z (eds) Scheduling theory and its applications. Wiley, New York, pp 194–226
Howard RA (1966) Dynamic programming. Manag Sci 12(5):317–348
Kats V, Levner E (2002) Cyclic scheduling in a robotic production line. J Sched 5(1):23–41
Minoux M (2008) Robust linear programming with right-hand-side uncertainty, duality and applications. In: Floudas CA, Pardalos PM (eds) Encyclopedia of optimization. Springer, New York, pp 3317–3327
Minoux M (2011) On 2-stage robust LP with RHS uncertainty: complexity results and applications. J Global Optim 49(3):521–537
Munier A (1996) The basic cyclic scheduling problem with linear precedence constraints. Discrete Appl Math 64(3):219–238
Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res 21(5):1154–1157
Sucha P, Pohl Z, Hanzálek Z (2004) Scheduling of iterative algorithms on FPGA with pipelined arithmetic unit. In: Proceedings of the 10th IEEE Real-time and embedded technology and applications symposium, 2004. RTAS 2004. IEEE, pp 404–412
Thiele A, Terry T, Epelman M (2009) Robust linear optimization with recourse. Technical report
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hamaz, I., Houssin, L. & Cafieri, S. A robust basic cyclic scheduling problem. EURO J Comput Optim 6, 291–313 (2018). https://doi.org/10.1007/s13675-018-0100-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13675-018-0100-3