A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints

DOI10.1287/MNSC.46.10.1365.12272zbMATH Open1232.90208OpenAlexW1976933890MaRDI QIDQ3114652FDOQ3114652

Authors: Ulrich Dorndorf, Erwin Pesch, Toàn Phan-Huy 

Publication date: 19 February 2012

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b08cfd54196b7fc0275b072f5355fd7997992262

Recommendations

• A branch-and-bound algorithm for the resource-constrained project scheduling problem
• On some implementations of solving the resource constrained project scheduling problems
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• A branch and bound algorithm for the resource-constrained project scheduling problem
• An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem

zbMATH Keywords

time windowsresource constraintsproject scheduling

Mathematics Subject Classification ID

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

Cited In (41)

• A chance-constrained optimization approach integrating project scheduling and material ordering to manage the uncertain material supply
• Flight gate assignment and recovery strategies with stochastic arrival and departure times
• Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
• Robust optimization models for project scheduling with resource availability cost
• Considering project management activities for engineering design groups
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models
• An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
• A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
• Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres
• A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
• Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming
• A branch-and-bound algorithm for the resource-constrained project scheduling problem
• Lower bounds for resource-constrained project scheduling problems.
• Production scheduling with alternative process plans
• A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
• A polyhedral study of event-based models for the resource-constrained project scheduling problem
• Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Scheduling and constraint propagation
• A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
• Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation
• A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times
• A constraint-based method for project scheduling with time windows
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints
• A Boolean satisfiability approach to the resource-constrained project scheduling problem
• Solving RCPSP/max by lazy clause generation
• Disruption management in flight gate scheduling
• A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
• A double genetic algorithm for the MRCPSP/max
• Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)
• A game theoretical approach to sharing penalties and rewards in projects
• Equitable scheduling on a single machine
• New model and heuristics for safety stock placement in general acyclic supply chain networks
• A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
• Project selection, scheduling and resource allocation with time dependent returns
• On some implementations of solving the resource constrained project scheduling problems
• An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags
• Scheduling contractors' farm‐to‐farm crop harvesting operations
• Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement

This page was built for publication: A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints

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