Active and stable project scheduling

DOI10.1007/S001860000092MaRDI QIDQ1401644zbMATH OpenOpenAlexFDO

Authors 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

active and stable schedulesgeneration schemesregular and nonregular objective functionsresource-constrained project scheduling

Mathematics Subject Classification ID

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

Recommendations

• Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
• scientific article; zbMATH DE number 2013754
• Project scheduling with calendars
• Resource-constrained project scheduling: Notation, classification, models, and methods
• A survey of variants and extensions of the resource-constrained project scheduling problem

Cited in

(15)

• Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
• Work patterns in project scheduling
• Scheduling project activities in a distributed environment
• Order-based neighborhoods for project scheduling with nonregular objective functions.
• Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
• Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems
• A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
• The construction of stable project baseline schedules
• Mixed-integer linear programming for resource leveling problems
• On the integration of diverging material flows into resource-constrained project scheduling
• Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization
• Exact methods for the resource levelling problem
• Reducing the feasible region to a scheduling problem
• A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
• Fifty years of research on resource-constrained project scheduling explored from different perspectives

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401644)