Scheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions
DOI10.1016/j.dam.2016.03.001zbMath1343.90039OpenAlexW2513191343MaRDI QIDQ284842
Pierre Lopez, Christian Artigues, Sandra Ulrich Ngueveu
Publication date: 18 May 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.03.001
combinatorial optimizationbranch-and-priceenergy-aware schedulingnon-linear efficiency functionspiecewise linear bounding
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)
Related Items (3)
Cites Work
- Unnamed Item
- Scheduling malleable tasks on parallel processors to minimize the makespan
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
- Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic
- Energetic reasoning for energy-constrained scheduling with a continuous resource
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- Global minimization via piecewise-linear underestimation
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Handbook on Scheduling
This page was built for publication: Scheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions