EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 59 / No 3 (May-June 2025) RAIRO-Oper. Res., 59 3 (2025) 1475-1500 References
Open Access
Issue
RAIRO-Oper. Res.
Volume 59, Number 3, May-June 2025
Page(s) 1475 - 1500
DOI https://doi.org/10.1051/ro/2025043
Published online 04 June 2025
  • P. Baptiste, C. Le Pape and W. Nuijten, Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Ann. Oper. Res. 92 (1999) 305–333. [CrossRef] [MathSciNet] [Google Scholar]
  • P. Baptiste, C. Le Pape and W. Nuijten, Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Vol. 39. Springer Science & Business Media (2001). [CrossRef] [Google Scholar]
  • N. Beldiceanu and M. Carlsson, A new multi-resource cumulatives constraint with negative heights, in International Conference on Principles and Practice of Constraint Programming. Springer (2002) 63–79. [Google Scholar]
  • N. Bonifas, Geometric and dual approaches to cumulative scheduling. Theses, Université Paris-Saclay (Dec. 2017). [Google Scholar]
  • J. Carlier, Disjonctions dans les ordonnancements. Revue française d’automatique, informatique, recherche opérationnelle. Recherche opérationnelle 9 (1975) 83–100. [CrossRef] [EDP Sciences] [Google Scholar]
  • J. Carlier, The one-machine sequencing problem. Eur. J. Oper. Res. 11 (1982) 42–47. Third EURO IV Special Issue. [CrossRef] [Google Scholar]
  • J. Carlier and E. Pinson, Adjustment of heads and tails for the job-shop problem. Eur. J. Oper. Res. 78 (1994) 146–161. [Google Scholar]
  • J. Carlier and E. Pinson, Jackson’s pseudo preemptive schedule for the Pm/ri, pi/Cmax scheduling problem. Ann. Oper. Res. 83 (1998) 41–58. [CrossRef] [MathSciNet] [Google Scholar]
  • J. Carlier and E. Pinson, Jackson’s pseudo-preemptive schedule and cumulative scheduling problems. Discrete Appl. Math. 145 (2004) 80–94. [CrossRef] [MathSciNet] [Google Scholar]
  • J. Carlier, E. Pinson, A. Sahli and A. Jouglet, An O(n2) algorithm for time-bound adjustments for the cumulative scheduling problem. Eur. J. Oper. Res. 286 (2020) 468–476. [CrossRef] [Google Scholar]
  • J. Carlier, A. Sahli, A. Jouglet and E. Pinson, A faster checker of the energetic reasoning for the cumulative scheduling problem. Int. J. Prod. Res. 60 (2022) 3419–3434. [CrossRef] [Google Scholar]
  • J. Carlier, A. Jouglet and A. Sahli, Algorithms to compute the energetic lower bounds of the cumulative scheduling problem. Ann. Oper. Res. 337 (2024) 683–713. [CrossRef] [MathSciNet] [Google Scholar]
  • M. Dell’Amico and S. Martello, Optimal scheduling of tasks on identical parallel processors. ORSA J. Comput. 7 (1995) 191–200. [Google Scholar]
  • A. Derrien and T. Petit, A new characterization of relevant intervals for energetic reasoning, in International Conference on Principles and Practice of Constraint Programming, edited by B. O’Sullivan. Springer, Springer International Publishing, Lyon, France (2014) 289–297. [CrossRef] [Google Scholar]
  • J. Erschler, P. Lopez and C. Thuriot, Raisonnement temporel sous contraintes de ressource et problèmes d’ordonnancement. Revue d’intelligence artificielle 5 (1991) 7–32. [Google Scholar]
  • L.R. Ford and D.R. Fulkerson, Flows in networks, in Flows in Networks. Princeton University Press (1962). [Google Scholar]
  • A. Gharbi and M. Haouari, Minimizing makespan on parallel machines subject to release dates and delivery times. J. Scheduling 5 (2002) 329–355. [CrossRef] [MathSciNet] [Google Scholar]
  • A. Gharbi and M. Haouari, An approximate decomposition algorithm for scheduling on parallel machines with heads and tails. Comput. Oper. Res. 34 (2007) 868–883. [CrossRef] [Google Scholar]
  • R. Graham, E. Lawler, J. Lenstra and A. Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, in Discrete Optimization II. Vol. 5 of Annals of Discrete Mathematics, edited by P. Hammer, E. Johnson and B. Korte. Elsevier (1979) 287–326. [CrossRef] [MathSciNet] [Google Scholar]
  • M. Haouari and A. Gharbi, An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines. Oper. Res. Lett. 31 (2003) 49–52. [CrossRef] [MathSciNet] [Google Scholar]
  • L. Hidri, A. Gharbi and M. Haouari, Energetic reasoning revisited: application to parallel machine scheduling. J. Scheduling 11 (2008) 239–252. [CrossRef] [MathSciNet] [Google Scholar]
  • W. Horn, Some simple scheduling algorithms. Nav. Res. Logistics Q. 21 (1974) 177–185. [CrossRef] [Google Scholar]
  • J. Labetoulle, E.L. Lawler, J.K. Lenstra and A.R. Kan, Preemptive scheduling of uniform machines subject to release dates, in Progress in Combinatorial Optimization. Academic Press (1984) 245–261. [CrossRef] [Google Scholar]
  • Y. Ouellet and C.-G. Quimper, A O(n log2 n) checker and O(n2 log n) filtering algorithm for the energetic reasoning, in International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, edited by W.-J. van Hoeve. Delft, The Netherlands (2018) 477–494. [Google Scholar]
  • F. Tercinet, C. Lenté and E. Néron, Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines. Oper. Res. Lett. 32 (2004) 326–330. [CrossRef] [MathSciNet] [Google Scholar]
  • F. Tercinet, E. Néron and C. Lenté, Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem. 4OR 4 (2006) 297–317. [CrossRef] [MathSciNet] [Google Scholar]
  • A. Tesch, A nearly exact propagation algorithm for energetic reasoning in o(n2 log n), in International Conference on Principles and Practice of Constraint Programming, edited by M. Rueher. Springer International Publishing (2016) 493–519. [CrossRef] [Google Scholar]
  • A. Tesch, Improving energetic propagations for cumulative scheduling, in International Conference on Principles and Practice of Constraint Programming, edited by J. Hooker. Springer, Springer International Publishing, Lille, France (2018) 629–645. [CrossRef] [Google Scholar]
  • A. Vandevelde, Minimizing the makespan in a multiprocessor flowshop. Master thesis, Eindhoven University of Technology (1994). [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.