Overload-Checking and Edge-Finding for Robust Cumulative Scheduling

References

• Artigues C, Leus R, Nobibon FT (2013) Robust optimization for resource-constrained project scheduling with uncertain activity durations. Flex. Serv. Manuf. J. 25(1–2):175–205.Crossref, Google Scholar
• Baptiste P, Le Pape C, Nuijten W (2012) Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems, vol. 39 (Springer Science & Business Media, New York).Google Scholar
• Beldiceanu N, Carlsson M, Poder E (2008) New filtering for the cumulative constraint in the context of non-overlapping rectangles. Perron L, Trick MA, eds. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Lecture Notes in Computer Science, vol. 5015 (Springer-Verlag, Berlin, Heidelberg), 21–35.Google Scholar
• Daniels RL, Carrillo JE (1997) β-robust scheduling for single-machine systems with uncertain processing times. IIE Trans. 29(11):977–985.Crossref, Google Scholar
• Davenport A, Gefflot C, Beck C (2014) Slack-based techniques for robust schedules. Sixth European Conf. Planning (AAAI, Washington, DC).Google Scholar
• Derrien A, Petit T, Zampelli S (2014) A declarative paradigm for robust cumulative scheduling. O’Sullivan B, ed. Principles and Practice of Constraint Programming (Springer, Cham), 298–306.Crossref, Google Scholar
• Drwal M, Józefczyk J (2020) Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times. Ann. Oper. Res. 284(1):263–282.Crossref, Google Scholar
• Fahimi H (2016) Efficient algorithms to solve scheduling problems with a variety of optimization criteria. PhD thesis, Université Laval.Google Scholar
• Fahimi H, Ouellet Y, Quimper CG (2018) Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last. Constraints 23(3):272–293.Crossref, Google Scholar
• Fowler DW, Brown KN (2003) Branching constraint satisfaction problems and markov decision problems compared. Ann. Oper. Res. 118(1–4):85–100.Crossref, Google Scholar
• Gao H (1996) Building Robust Schedules Using Temporal Protection: An Empirical Study of Constraint Based Scheduling Under Machine Failure Uncertainty (University of Toronto, Toronto, Canada).Google Scholar
• Gay S, Hartert R, Schaus P (2015) Simple and scalable time-table filtering for the cumulative constraint. Principles and Practice of Constraint Programming (Springer, Cham), 149–157.Crossref, Google Scholar
• Hebrard E, Hnich B, Walsh T (2004) Super solutions in constraint programming. Régin JC, Rueher M eds. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Lecture Notes in Computer Science, vol. 3011 (Springer, Berlin, Heidelberg), 157–172.Google Scholar
• Kameugne R, Fotso LP, Scott J, Ngo-Kateu Y (2014) A quadratic edge-finding filtering algorithm for cumulative resource constraints. Constraints 19(3):243–269.Crossref, Google Scholar
• Letort A, Beldiceanu N, Carlsson M (2012) A scalable sweep algorithm for the cumulative constraint. Principles and Practice of Constraint Programming (Springer, Cham), 439–454.Crossref, Google Scholar
• Leung JYT (2004) Handbook of Scheduling: Algorithms, Models, and Performance Analysis (CRC Press, Boca Raton, FL).Crossref, Google Scholar
• Ma G, Gu L, Li N (2015) Scenario-based proactive robust optimization for critical-chain project scheduling. J. Constr. Eng. Management 141(10):04015030.Crossref, Google Scholar
• Mercier L, Van Hentenryck P (2008) Edge finding for cumulative scheduling. INFORMS J. Comput. 20(1):143–153.Link, Google Scholar
• Ning C, You F (2018) Robust process scheduling under uncertainty with regret. Friedl A, Klemeš JJ, Radl S, Varbanov PS, Wallek T, eds. 28th European Symposium on Computer Aided Process Engineering, Computer Aided Chemical Engineering, vol. 43 (Elsevier, Amsterdam, Netherland), 913–918.Crossref, Google Scholar
• Nuijten WW (1994) Time and resource constrained scheduling: A constraint satisfaction approach. PhD thesis, Technische Universiteit Eindhoven.Google Scholar
• Ouellet P, Quimper CG (2013) Time-table-extended-edge-finding for the cumulative constraint. Schulte C ed. Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, vol. 8124 (Springer, Berlin, Heidelberg), 562–577.Google Scholar
• Rossi F, Van Beek P, Walsh T (2006) Handbook of Constraint Programming (Elsevier, Amsterdam).Google Scholar
• Vilím P (2009a) Edge finding filtering algorithm for discrete cumulative resources in O(knlogn). Gent IP, eds. Principles and Practice of Constraint Programming - CP 2009. Lecture Notes in Computer Science, vol. 5732 (Springer, Berlin, Heidelberg), 802–816.Crossref, Google Scholar
• Vilím P (2009b) Max energy filtering algorithm for discrete cumulative resources. van Hoeve WJ, Hooker JN, eds. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Lecture Notes in Computer Science, vol. 5547 (Springer, Berlin, Heidelberg), 294–308.Google Scholar
• Wolf A, Schrader G (2005) O(nlogn) overload checking for the cumulative constraint and its application. Declarative Programming for Knowledge Management (Springer, Berlin, Heidelberg), 88–101.Google Scholar
• Wu CW, Brown KN, Beck JC (2009) Scheduling with uncertain durations: Modeling β-robust scheduling with constraints. Comput. Oper. Res. 36(8):2348–2356.Crossref, Google Scholar
• Yamashiro H, Nonaka H (2021) Estimation of processing time using machine learning and real factory data for optimization of parallel machine scheduling problem. Oper. Res. Perspect. 8:100196.Google Scholar
• Zampelli S, Vergados Y, Van Schaeren R, Dullaert W, Raa B (2013) The berth allocation and quay crane assignment problem using a cp approach. Schulte C, eds. Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, vol. 8124 (Springer, Berlin, Heidelberg), 880–896.Google Scholar
• Zhang Y, Shen ZJM, Song S (2018) Exact algorithms for distributionally β-robust machine scheduling with uncertain processing times. INFORMS J. Comput. 30(4):662–676.Link, Google Scholar