Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
DOI10.1007/S00291-015-0423-XzbMATH Open1339.90147OpenAlexW2189941467MaRDI QIDQ280177FDOQ280177
Authors: Margaux Nattaf, Christian Artigues, Pierre Lopez, David Rivreau
Publication date: 4 May 2016
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-015-0423-x
Recommendations
- Energetic reasoning for energy-constrained scheduling with a continuous resource
- A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
- Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
- Energetic reasoning revisited: Application to parallel machine scheduling
- Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
- Mixed-integer linear programming for resource leveling problems
- Scheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions
- IP-based energetic reasoning for the resource constrained project scheduling problem
mixed integer programmingbranching schemecontinuous resourcescontinuous schedulingenergetic reasoningenergy constraintslinear efficiency functions
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)
Cites Work
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- A priority-rule method for project scheduling with work-content constraints
- Energetic reasoning for energy-constrained scheduling with a continuous resource
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- Title not available (Why is that?)
- MIP models for resource-constrained project scheduling with flexible resource profiles
- Algorithms for Reporting and Counting Geometric Intersections
- Une méthode arborescente pour résoudre les problèmes cumulatifs
- Scheduling malleable tasks on parallel processors to minimize the makespan
- Event-based MILP models for resource-constrained project scheduling problems
- A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
Cited In (7)
- Editorial ``Project management and scheduling
- Scheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions
- A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
- The parcel hub scheduling problem with limited conveyor capacity and controllable unloading speeds
- Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
- Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
- Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions
This page was built for publication: Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280177)