4.7 Article

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

Journal

COMPUTERS & INDUSTRIAL ENGINEERING
Volume 47, Issue 1, Pages 91-101

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2004.03.002

Keywords

hoist scheduling; constraint satisfaction problem; backtracking; heuristics

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available