A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem

A heuristic algorithm for solving the single-hoist, multiple-product scheduling problem is presented. The algorithm uses a non-standard Constraint Satisfaction Problem model and employs variable ordering, forward checking and backtracking. Computational results, including comparison with existing algorithms in terms of solution quality and speed, are presented. (C) 2004 Elsevier Ltd. All rights reserved.