math.OCNov 10, 2026

Two Communities, One Problem: Branch-and-Bound vs. A* for Resource-Constrained Project Scheduling

Authors: Izack Cohen, Dominik Kress, Lara Nehrke, Erwin Pesch, Shimrit Shtern

Organizations: Faculty of Engineering, Bar-Ilan University, Max and Anna Webb Street, Ramat Gan 5290002, Israel · Business Administration, especially Procurement and Production, Helmut Schmidt University/University of the Federal Armed Forces Hamburg, Friedrich-Ebert-Damm 245, D-22159 Hamburg, Germany · Management Information Science, University of Siegen, Kohlbettstr. 15, D-57072 Siegen, Germany

Abstract

Branch-and-Bound (B&B) and A∗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∗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∗A^* substantially outperforms the B&B variants considered. With additional pruning rules, A∗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.

Figures & tables

Appendix figures & tables3 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Petri Net Induced Heuristic Search for Resource Constrained Scheduling

    May 15, 2026Ido Lublin, Dor Atzmon, Izack CohenResource-Constrained Project SchedulingCombinatorial Optimization

  2. Resource-constrained Project Scheduling with Time-of-Use Energy Tariffs and Machine States: A Logic-based Benders Decomposition Approach

    Jan 10, 2026Corentin Juvigny, Antonín Novák, Jan Mandík +1Resource-Constrained Project SchedulingCombinatorial Optimization

  3. On inferring cumulative constraints

    Feb 17, 2026Konstantin SidorovResource-Constrained Project SchedulingConstraint Programming