Two Communities, One Problem: Branch-and-Bound vs. A* for Resource-Constrained Project Scheduling
Izack Cohen, Dominik Kress, Lara Nehrke, Erwin Pesch, Shimrit Shtern
Abstract
Branch-and-Bound (B&B) and A* are popular exact search methods originating from Operations Research and Artificial Intelligence, respectively. Although the two methods share fundamental search principles, their different ways of exploring the search space can lead to substantially different computational performance. We investigate these differences using the Resource-Constrained Project Scheduling Problem (RCPSP) as an exemplary problem setting. We first establish the relationships between mixed-integer linear programming, state-action, and timed Petri-net representations. Since B&B and A* admit numerous algorithmic enhancements, we focus on relatively basic implementations. This allows us to examine the fundamental differences between the methods rather than compare the performance of state-of-the-art solvers. By using the same lower bound and best-first node selection, we isolate the effects of the search mechanisms, particularly the identification of equivalent states reached through different scheduling decision sequences. Experiments on 480 benchmark RCPSP instances show that graph-based A* substantially outperforms the B&B variants considered. With additional pruning rules, A* proves optimality for all 480 instances, compared with 445 for best-first B&B under the same time and memory limits. Depth-first B&B uses less memory and can find feasible solutions even when the search does not finish within the time limit. Stronger linear programming relaxations reduce the search space but introduce considerable computational overhead. Our findings highlight the importance of duplicate-state detection and clarify the computational trade-offs between the search approaches. These insights can help researchers select an appropriate method and identify opportunities to incorporate effective mechanisms from one approach into the other.
Create a lesson
Related papers
Optimal Scheduling of Multi-Site AI Data Centers in Day-Ahead Markets
Xinyang Zhou, Guido Cavraro
Minimization of free energy in a Poisson--Boltzmann problem
Shahid Ali, Klemen Bohinc, Angeles Martinez et al.
Lyapunov Theory for Output-to-State Stability of Nonlinear Infinite-Dimensional Systems
Qiaoling Chen, Andrii Mironchenko, Fabian Wirth
Semi-global Convergence and Finite-Sample Error Bounds for Model Predictive Path Integral Control
Christian Fiedler, Giacomo Borghi
When Suspicion Adds Up: A Stochastic Framework for Optimizing Honeypot-Based Insider-Threat Detection
Saharnaz Mehrani, Lujia Zhan, Mohsen Emadikhiav et al.
Hamiltonian Potential Optimization for Partially Observed Stochastic Optimal Control
Christian Bayer, Saifeddine Ben Naamia, Erik von Schwerin et al.