Name
Title | ||
|---|---|---|
A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.cie.2004.03.002 | Computers & Industrial Engineering |
Keywords | Field | DocType |
Hoist scheduling,Constraint satisfaction problem,Backtracking,Heuristics | Constraint satisfaction,Mathematical optimization,Local consistency,Min-conflicts algorithm,Computer science,Algorithm,Constraint satisfaction problem,Constraint satisfaction dual problem,Backtracking,Constraint logic programming,Hybrid algorithm (constraint satisfaction) | Journal |
Volume | Issue | ISSN |
47 | 1 | 0360-8352 |
Citations | PageRank | References |
9 | 0.60 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Khalil S. Hindi | 1 | 398 | 22.75 |
| Krzysztof Fleszar | 2 | 368 | 25.38 |