Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation

Yves Caseau, François Laburthe. Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation. In Michel Deza, Reinhardt Euler, Yannis Manoussakis, editors, Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers. Volume 1120 of Lecture Notes in Computer Science, pages 129-149, Springer, 1995.

Abstract

Abstract is missing.