| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652710 | Electronic Notes in Discrete Mathematics | 2010 | 8 Pages |
Abstract
In this paper, we deal with the preemptive asymmetric stacker crane problem in an heuristic way. We first turn this problem into a specific tree design problem. We next derive from this new representation simple, efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and at evaluating the impact of the preemption hypothesis.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
