Scattered branch and bound. An adaptive search strategy applied to resource-constrained project scheduling

zbMath0940.90035MaRDI QIDQ1969542

Yanyan Li

Publication date: 25 July 2000

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

branch and boundresource-constrained project schedulingintelligent search

Mathematics Subject Classification ID

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

Related Items (8)

A Boolean satisfiability approach to the resource-constrained project scheduling problem ⋮ Solving the car sequencing problem via branch \& bound ⋮ A random key based genetic algorithm for the resource constrained project scheduling problem ⋮ Justification and RCPSP: a technique that pays ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times ⋮ Bidirectional planning: Improving priority rule-based heuristics for scheduling resource-constrained projects ⋮ Iterative beam search for car sequencing

This page was built for publication: Scattered branch and bound. An adaptive search strategy applied to resource-constrained project scheduling