A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags

DOI10.1016/S0377-2217(02)00136-4zbMath1012.90513MaRDI QIDQ1869389

Roland Heilmann

Publication date: 10 April 2003

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

zbMATH Keywords

branch-and-boundmaximum time lagsproject management and schedulingmulti-moderesource-constrained

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Related Items (22)

On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations ⋮ Scheduling under the network of temporo-spatial proximity relationships ⋮ Modelling and solving generalised operational surgery scheduling problems ⋮ A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags ⋮ A polyhedral study of event-based models for the resource-constrained project scheduling problem ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times ⋮ Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting ⋮ Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres ⋮ A modified PSO algorithm for minimizing the total costs of resources in MRCPSP ⋮ A min-flow algorithm for minimal critical set detection in resource constrained project scheduling ⋮ Mathematical model for cyclic scheduling with work-in-process minimization ⋮ A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags ⋮ Considering project management activities for engineering design groups ⋮ A practical and robust execution time-frame procedure for the multi-mode resource-constrained project scheduling problem with minimal and maximal time lags ⋮ Skilled workforce scheduling in service centres ⋮ A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS ⋮ A double genetic algorithm for the MRCPSP/max ⋮ Reactive scheduling in the multi-mode RCPSP ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting ⋮ Project selection, scheduling and resource allocation with time dependent returns

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for the resource-constrained project scheduling problem
• Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
• Resource-constrained project scheduling. Exact methods for the multi-mode case
• DSS for multiobjective project scheduling
• An exact algorithm for project scheduling with multiple modes
• Active and stable project scheduling
• Resource-constrained project scheduling: Notation, classification, models, and methods
• The multi-mode resource-constrained project scheduling problem with generalized precedence relations
• A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
• An Algorithm for Solving the Job-Shop Problem
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem

This page was built for publication: A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags