| Article ID: | iaor2005499 |
| Country: | Netherlands |
| Volume: | 47 |
| Issue: | 1 |
| Start Page Number: | 91 |
| End Page Number: | 101 |
| Publication Date: | Aug 2004 |
| Journal: | Computers & Industrial Engineering |
| Authors: | Hindi Khalil S., Fleszar Krzysztof |
| Keywords: | constraint programming |
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.