Active and stable project scheduling

DOI10.1007/s001860000092zbMath1023.90029OpenAlexW1986738403MaRDI QIDQ1401644

Christoph Schwindt, Klaus Neumann, Hartwig Nübel

Publication date: 18 August 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860000092

zbMATH Keywords

resource-constrained project schedulingactive and stable schedulesgeneration schemesregular and nonregular objective functions

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (10)

The construction of stable project baseline schedules ⋮ On the integration of diverging material flows into resource-constrained project scheduling ⋮ Mixed-integer linear programming for resource leveling problems ⋮ A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints ⋮ Order-based neighborhoods for project scheduling with nonregular objective functions. ⋮ Exact methods for the resource levelling problem ⋮ Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems ⋮ Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints ⋮ A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags ⋮ Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization

This page was built for publication: Active and stable project scheduling