Abstract
This paper addresses a scheduling problem with a continuously divisible, cumulative and renewable resource with limited capacity. During its processing, each task consumes a part of this resource, which lies between a minimum and a maximum requirement. A task is finished when a certain amount of energy is received by it within its time window. This energy is received via the resource and an amount of resource is converted into an amount of energy with a non-decreasing and continuous function. The goal is to find a feasible schedule, which is already NP-complete, and then to minimize the resource consumption. For the case where all functions are linear, we present two new mixed-integer linear programs (MILP), as well as improvements of an existing formulation. We also present a detailed version of the adaptation of the well-known “left-shift/right-shift” satisfiability test for the cumulative constraint and the associated time-window adjustments to our problem. For this test, three ways of computing relevant intervals are described. Finally, a hybrid branch-and-bound using both the satisfiability test and the MILP is presented with a new heuristic for choosing the variable on which the branching is done. Computational experiments on randomly generated instances are reported in order to compare all of these solution methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
Note that some authors define a cumulative resource with other meanings, such as storage resource (Schwindt 2005). In this paper, a resource is called cumulative in the Constraint Programming literature sense (Baptiste et al. 2001; Derrien and Petit 2014), i.e., a synonym of a renewable resource with an availability larger than or equal to one.
Cgal, Computational Geometry Algorithms Library. http://www.cgal.org.
Such that a feasible solution has been found or a proof that no feasible solution exists was obtained.
References
Artigues C, Lopez P, Haït A (2013) The energy scheduling problem: industrial case study and constraint propagation techniques. Int J Prod Econ 143(1):13–23
Artigues C, Lopez P (2015) Energetic reasoning for energy-constrained scheduling with a continuous resource. J Sched 18(3):225–241
Baptiste P, Le Pape C, Nuijten W (2001) Constraint-based scheduling. Kluwer Academic Publishers, Boston/Dordrecht/London
Bentley JL, Ottmann TA (1979) Algorithms for reporting and counting geometric intersections. IEEE Trans Comput 28(9):643–647
Błażewicz J, Ecker KH, Pesch E, Schmidt G, Wȩglarz J (2001) Scheduling computer and manufacturing processes. Springer-Verlag, Berlin/Heidelberg
Błażewicz J, Machowiak M, Wȩglarz J, Kovalyov M, Trystram D (2004) Scheduling malleable tasks on parallel processors to minimize the makespan. Ann Oper Res 129(1–4):65–80
Carlier J, Latapie B (1991) Une méthode arborescente pour résoudre les problèmes cumulatifs. RAIRO Recherche opérationnelle 25(3):311–340
Derrien A, Petit T (2014) A new characterization of relevant intervals for energetic reasoning. In: O’Sullivan B (ed) Principles and practice of constraint programming. Lecture notes in computer science, vol 8656, Springer, pp 289–297
Erschler J, Lopez P (1990) Energy-based approach for task scheduling under time and resources constraints. 2nd International workshop on project management and scheduling, pp 115–121, Compiègne, France
Fündeling C-U, Trautmann N (2010) A priority-rule method for project scheduling with work-content constraints. Eur J Oper Res 203(3):568–574
Józefowska J, Mika M, Różycki R, Waligóra G, Wȩglarz J (1999) Project scheduling under discrete and continuous resources. In: Wȩglarz J (ed) Project scheduling: recent models, algorithms, and applications. Kluwer Academic Publishers, Boston, pp 289–308
Kis T (2005) A branch-and-cut algorithm for scheduling of project with variable-intensity activities. Math Program Ser A 103:515–539
Koné O, Artigues C, Lopez P, Mongeau M (2011) Event-based MILP models for resource-constrained project scheduling problems. Comput Oper Res 38(1):3–13
Naber A, Kolisch R (2014a) MIP models for resource-constrained project scheduling with flexible resource profiles. Eur J Oper Res 239:335–348
Naber A, Kolisch R (2014b) A continuous time model for the resource-constrained project scheduling with flexible resource profiles. In: Proceedings of the 14th international conference on project management and scheduling, pp 166–168, Munich, Germany
Nattaf M, Artigues C, Lopez P(2014) A polynomial satisfiability test using energetic reasoning for energy constraint scheduling. 14th International workshop on project management and scheduling, pp 169–172, Munich, Germany
Nattaf M, Artigues C, Lopez P (2015) A hybrid exact method for a scheduling problem with a continuous resource and energy constraints. Constraints 20(3):304–324
Schwindt C (2005) Resource allocation in project management. Springer, Berlin
Wȩglarz J, Józefowska J, Mika M, Waligóra G (2009) Project scheduling with finite or infinite number of activity processing modes—a survey. Eur J Oper Res 208:177–205
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Nattaf, M., Artigues, C., Lopez, P. et al. Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions. OR Spectrum 38, 459–492 (2016). https://doi.org/10.1007/s00291-015-0423-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-015-0423-x