Advertisement

Journal of Scheduling

, Volume 10, Issue 4–5, pp 327–336 | Cite as

A tabu search heuristic for the quay crane scheduling problem

  • Marcello Sammarra
  • Jean-François CordeauEmail author
  • Gilbert Laporte
  • M. Flavia Monaco
Article

Abstract

This paper proposes a tabu search heuristic for the Quay Crane Scheduling Problem (QCSP), the problem of scheduling a fixed number of quay cranes in order to load and unload containers into and from a ship. The optimality criterion considered is the minimum completion time. Precedence and non-simultaneity constraints between tasks are taken into account. The former originate from the different kind of operations that each crane has to perform; the latter are needed in order to avoid interferences between the cranes. The QCSP is decomposed into a routing problem and a scheduling problem. The routing problem is solved by a tabu search heuristic, while a local search technique is used to generate the solution of the scheduling problem. This is done by minimizing the longest path length in a disjunctive graph. The effectiveness of our algorithm is assessed by comparing it to a branch-and-cut algorithm and to a Greedy Randomized Adaptive Search Procedure (GRASP).

Keywords

Container terminal Crane scheduling Disjunctive graph Tabu search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows—theory, algorithms and applications. Englewood Cliffs: Prentice Hall. Google Scholar
  2. Cordeau, J.-F., Gendreau, M., & Laporte, G. (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30, 105–119. CrossRefGoogle Scholar
  3. Daganzo, C. F. (1989). The crane scheduling problem. Transportation Research B, 23, 159–175. CrossRefGoogle Scholar
  4. Daganzo, C. F., & Peterkofsky, R. I. (1990). A branch and bound solution method for the crane scheduling problem. Transportation Research B, 24, 159–172. CrossRefGoogle Scholar
  5. Gendreau, M., & Potvin, J.-Y. (2005). Tabu search. In E. K. Burke & G. Kendall (Eds.), Search methodologies: introductory tutorials in optimization and decision support techniques. Berlin: Springer. Google Scholar
  6. Glover, F., & Laguna, M. (1993). Tabu search. In C. R. Reeves (Ed.), Modern heuristics techniques for combinatorial problems. Oxford: Blackwell. Google Scholar
  7. Glover, F., & Laguna, M. (1998). Tabu search. Boston: Kluwer. Google Scholar
  8. Kim, K. H., & Park, Y. M. (2004). A crane scheduling method for port container terminals. European Journal of Operational Research, 156, 752–768. CrossRefGoogle Scholar
  9. Lim, A., Rodrigues, B., Xiao, F., & Zhu, Y. (2004). Crane scheduling with spatial constraints. Naval Research Logistics, 51, 386–406. CrossRefGoogle Scholar
  10. Moccia, L., Cordeau, J.-F., Gaudioso, M., & Laporte, G. (2006). A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Naval Research Logistics, 53, 45–59. CrossRefGoogle Scholar
  11. Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Management Science, 42, 797–813. CrossRefGoogle Scholar
  12. Pinedo, M. (1995). Scheduling—theory, algorithms and systems. Englewood Cliffs: Prentice Hall. Google Scholar
  13. Pinedo, M., & Singer, M. (1999). A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics, 46, 1–17. CrossRefGoogle Scholar
  14. Roy, B., & Soussmann, B. (1964). Les problèmes d’ordonnancement avec constraintes disjonctives. Note D.S. 9 bis, SEMA, Paris. Google Scholar
  15. Steenken, D., Voss, S., & Stahlbock, R. (2004). Container terminal operation and operations research—a classification and literature review. Operations Research Spectrum, 26, 3–49. Google Scholar
  16. Van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992). Job shop scheduling by simulated annealing. Operations Research, 40, 113–125. Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Marcello Sammarra
    • 1
  • Jean-François Cordeau
    • 2
    Email author
  • Gilbert Laporte
    • 3
  • M. Flavia Monaco
    • 1
  1. 1.Dipartimento di Elettronica, Informatica e SistemisticaUniversità della CalabriaRendeItaly
  2. 2.Canada Research Chair in Logistics and TransportationHEC MontréalMontréalCanada
  3. 3.Canada Research Chair in Distribution ManagementHEC MontréalMontréalCanada

Personalised recommendations