Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
From MaRDI portal
Publication:1732114
DOI10.1016/j.dam.2018.11.008zbMath1412.90054OpenAlexW2615061682WikidataQ128610579 ScholiaQ128610579MaRDI QIDQ1732114
Tamás Kis, Margaux Nattaf, Markó Horváth, Christian Artigues, Pierre Lopez
Publication date: 22 March 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://eprints.sztaki.hu/9790/
mixed integer programmingvalid inequalitiespolyhedral combinatoricscontinuous resourcescontinuous schedulinglinear efficiency functions
Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)
Related Items
A polyhedral study of event-based models for the resource-constrained project scheduling problem ⋮ Continuous-time formulations for multi-mode project scheduling ⋮ Polyhedral Results and Branch-and-Cut for the Resource Loading Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
- 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
- A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
- A priority-rule method for project scheduling with work-content constraints
- Resource-constrained project scheduling with flexible resource profiles in continuous time
- Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions
- Energetic reasoning for energy-constrained scheduling with a continuous resource
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- Connected and alternating vectors: Polyhedra and algorithms
