A hybrid exact method for a scheduling problem with a continuous resource and energy constraints

DOI10.1007/s10601-015-9192-zzbMath1327.90073OpenAlexW2144013806MaRDI QIDQ890001

Pierre Lopez, Christian Artigues, Margaux Nattaf

Publication date: 9 November 2015

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-015-9192-z

zbMATH Keywords

mixed integer programmingbranching schemecontinuous schedulingenergetic reasoningenergy constraints

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (7)

Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions ⋮ Scheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions ⋮ Minimizing grid capacity in preemptive electric vehicle charging orchestration: complexity, exact and heuristic approaches ⋮ Allocation of limited resources under quadratic constraints ⋮ Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions ⋮ Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem ⋮ Scheduling aspects in keyword extraction problem

Cites Work

• Unnamed Item
• MIP models for resource-constrained project scheduling with flexible resource profiles
• Scheduling malleable tasks on parallel processors to minimize the makespan
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• Event-based MILP models for resource-constrained project scheduling problems
• A priority-rule method for project scheduling with work-content constraints
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Energetic reasoning for energy-constrained scheduling with a continuous resource
• A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
• Algorithms for Reporting and Counting Geometric Intersections
• Une méthode arborescente pour résoudre les problèmes cumulatifs

This page was built for publication: A hybrid exact method for a scheduling problem with a continuous resource and energy constraints