Abstract
We consider the problem of scheduling the movements of cranes in a container storage yard so as to minimize the total unfinished workload at the end of each time period. The problem is formulated as a mixed-integer linear program, and the computational complexity of the problem is analyzed. A Lagrangian decomposition solution procedure is described. A new solution approach, called the successive piecewise-linear approximation method, is also developed. Through computational experiments, we show that our proposed solution methods are both efficient and effective for large-sized problems.
| Original language | English |
|---|---|
| Pages (from-to) | 79-93 |
| Journal | Transportation Science |
| Volume | 36 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Feb 2002 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Funding
The authors would like to thank two anonymous referees for their helpful comments and suggestions. This research is supported by Grant HKUST 6205/99E from the Hong Kong Research Grants Council.