Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption.

DOI10.1016/S0377-2217(02)00756-7zbMath1053.90044OpenAlexW4298429526MaRDI QIDQ1417510

Emmanuel Poder, Eric Sanlaville, Nicolas Beldiceanu

Publication date: 5 January 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00756-7

zbMATH Keywords

SchedulingConstraint programmingCompulsory partCore timeResource constraint project scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Continuous filling and emptying of storage systems in constraint-based scheduling

Uses Software

• CHIP

Cites Work

• Unnamed Item
• Unnamed Item
• Object-oriented interaction in resource constrained scheduling
• A language and a program for stating and solving combinatorial problems
• Scheduling under labour resource constraints
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
• Solving various weighted matching problems with constraints

This page was built for publication: Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption.