{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T12:36:30Z","timestamp":1726144590630},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T00:00:00Z","timestamp":1187136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2007,9,24]]},"DOI":"10.1007\/s10951-007-0029-5","type":"journal-article","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T19:53:34Z","timestamp":1187121214000},"page":"327-336","source":"Crossref","is-referenced-by-count":133,"title":["A tabu search heuristic for the quay crane scheduling problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Marcello","family":"Sammarra","sequence":"first","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Cordeau","sequence":"additional","affiliation":[]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[]},{"given":"M. Flavia","family":"Monaco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,8,15]]},"reference":[{"key":"29_CR1","volume-title":"Network flows\u2014theory, algorithms and applications","author":"R. K. Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows\u2014theory, algorithms and applications. Englewood Cliffs: Prentice Hall."},{"key":"29_CR2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J.-F. Cordeau","year":"1997","unstructured":"Cordeau, J.-F., Gendreau, M., & Laporte, G. (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30, 105\u2013119.","journal-title":"Networks"},{"key":"29_CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0191-2615(89)90001-5","volume":"23","author":"C. F. Daganzo","year":"1989","unstructured":"Daganzo, C. F. (1989). The crane scheduling problem. Transportation Research B, 23, 159\u2013175.","journal-title":"Transportation Research B"},{"key":"29_CR4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0191-2615(90)90014-P","volume":"24","author":"C. F. Daganzo","year":"1990","unstructured":"Daganzo, C. F., & Peterkofsky, R. I. (1990). A branch and bound solution method for the crane scheduling problem. Transportation Research B, 24, 159\u2013172.","journal-title":"Transportation Research B"},{"key":"29_CR5","volume-title":"Search methodologies: introductory tutorials in optimization and decision support techniques","author":"M. Gendreau","year":"2005","unstructured":"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."},{"key":"29_CR6","volume-title":"Modern heuristics techniques for combinatorial problems","author":"F. Glover","year":"1993","unstructured":"Glover, F., & Laguna, M. (1993). Tabu search. In C. R. Reeves (Ed.), Modern heuristics techniques for combinatorial problems. Oxford: Blackwell."},{"key":"29_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0303-9_33","volume-title":"Tabu search","author":"F. Glover","year":"1998","unstructured":"Glover, F., & Laguna, M. (1998). Tabu search. Boston: Kluwer."},{"key":"29_CR8","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/S0377-2217(03)00133-4","volume":"156","author":"K. H. Kim","year":"2004","unstructured":"Kim, K. H., & Park, Y. M. (2004). A crane scheduling method for port container terminals. European Journal of Operational Research, 156, 752\u2013768.","journal-title":"European Journal of Operational Research"},{"key":"29_CR9","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1002\/nav.10123","volume":"51","author":"A. Lim","year":"2004","unstructured":"Lim, A., Rodrigues, B., Xiao, F., & Zhu, Y. (2004). Crane scheduling with spatial constraints. Naval Research Logistics, 51, 386\u2013406.","journal-title":"Naval Research Logistics"},{"key":"29_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/nav.20121","volume":"53","author":"L. Moccia","year":"2006","unstructured":"Moccia, L., Cordeau, J.-F., Gaudioso, M., & Laporte, G. (2006). A\u00a0branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Naval Research Logistics, 53, 45\u201359.","journal-title":"Naval Research Logistics"},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Management Science, 42, 797\u2013813.","journal-title":"Management Science"},{"key":"29_CR12","volume-title":"Scheduling\u2014theory, algorithms and systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M. (1995). Scheduling\u2014theory, algorithms and systems. Englewood Cliffs: Prentice Hall."},{"key":"29_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<1::AID-NAV1>3.0.CO;2-#","volume":"46","author":"M. Pinedo","year":"1999","unstructured":"Pinedo, M., & Singer, M. (1999). A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics, 46, 1\u201317.","journal-title":"Naval Research Logistics"},{"key":"29_CR14","unstructured":"Roy, B., & Soussmann, B. (1964). Les probl\u00e8mes d\u2019ordonnancement avec constraintes disjonctives. Note D.S. 9 bis, SEMA, Paris."},{"key":"29_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00291-003-0157-z","volume":"26","author":"D. Steenken","year":"2004","unstructured":"Steenken, D., Voss, S., & Stahlbock, R. (2004). Container terminal operation and operations research\u2014a classification and literature review. Operations Research Spectrum, 26, 3\u201349.","journal-title":"Operations Research Spectrum"},{"key":"29_CR16","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P. J. M. Laarhoven Van","year":"1992","unstructured":"Van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992). Job shop scheduling by simulated annealing. Operations Research, 40, 113\u2013125.","journal-title":"Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0029-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-007-0029-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0029-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:40Z","timestamp":1559468380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-007-0029-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,15]]},"references-count":16,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2007,9,24]]}},"alternative-id":["29"],"URL":"https:\/\/doi.org\/10.1007\/s10951-007-0029-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,15]]}}}