{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T01:54:05Z","timestamp":1773453245613,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,5,21]],"date-time":"2016-05-21T00:00:00Z","timestamp":1463788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00291-016-0446-y","type":"journal-article","created":{"date-parts":[[2016,5,23]],"date-time":"2016-05-23T11:43:30Z","timestamp":1464003810000},"page":"137-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["When road trains supply freight trains: scheduling the container loading process by gantry crane between multi-trailer trucks and freight trains"],"prefix":"10.1007","volume":"39","author":[{"given":"Nils","family":"Boysen","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Scholl","sequence":"additional","affiliation":[]},{"given":"Konrad","family":"Stephan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,21]]},"reference":[{"key":"446_CR1","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.ejor.2009.10.031","volume":"204","author":"N Boysen","year":"2010","unstructured":"Boysen N, Fliedner M (2010) Determining crane areas in intermodal transshipment yards: the yard partition problem. Eur J Oper Res 204:336\u2013342","journal-title":"Eur J Oper Res"},{"key":"446_CR2","doi-asserted-by":"crossref","unstructured":"Boysen N, Stephan K (2016) A survey on single crane scheduling in automated storage\/retrieval systems. Eur J Oper Res (to appear)","DOI":"10.1016\/j.ejor.2016.04.008"},{"key":"446_CR3","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1287\/trsc.1120.0415","volume":"47","author":"N Boysen","year":"2013","unstructured":"Boysen N, Fliedner M, Jaehn F, Pesch E (2013) A survey on container processing in railway yards. Transp Sci 47:312\u2013329","journal-title":"Transp Sci"},{"key":"446_CR4","unstructured":"Boysen N, Briskorn D, Meisel F (2014) A generalized classification scheme for crane scheduling with interference. In: Working paper Friedrich-Schiller-University Jena"},{"key":"446_CR5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0305-0548(75)90015-5","volume":"2","author":"JA Chisman","year":"1975","unstructured":"Chisman JA (1975) The clustered traveling salesman problem. Comput Oper Res 2:115\u2013119","journal-title":"Comput Oper Res"},{"key":"446_CR6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.cor.2014.08.001","volume":"53","author":"J-F Cordeau","year":"2015","unstructured":"Cordeau J-F, Legato P, Mazza RM, Trunfio R (2015) Simulation-based optimization for housekeeping in a container transshipment terminal. Comput Oper Res 53:81\u201395","journal-title":"Comput Oper Res"},{"key":"446_CR7","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s00291-006-0056-1","volume":"28","author":"MB Duinkerken","year":"2006","unstructured":"Duinkerken MB, Dekker R, Kurstjens ST, Ottjes JA, Dellaert NP (2006) Comparing transportation systems for inter-terminal transport at the Maasvlakte container terminals. OR Spectr 28:469\u2013493","journal-title":"OR Spectr"},{"key":"446_CR8","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1080\/03081069308717517","volume":"17","author":"L Ferreira","year":"1993","unstructured":"Ferreira L, Sigut J (1993) Measuring the performance of intermodal freight terminals. Transp Plan Technol 17:268\u2013279","journal-title":"Transp Plan Technol"},{"key":"446_CR9","volume-title":"Computers and intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. Freeman, New York"},{"key":"446_CR10","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"PC Gilmore","year":"1964","unstructured":"Gilmore PC, Gomory RE (1964) Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Oper Res 12:655\u2013679","journal-title":"Oper Res"},{"key":"446_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0167-188X(88)90012-2","volume":"13","author":"M Goetschalckx","year":"1988","unstructured":"Goetschalckx M, Ratliff HD (1988) An efficient algorithm to cluster order picking items in a wide aisle. Eng Costs Prod Econ 13:263\u2013271","journal-title":"Eng Costs Prod Econ"},{"key":"446_CR12","unstructured":"HK (2013) Hafen Hamburg auf einen Blick (in German). Handelskammer Hamburg, Hamburg"},{"key":"446_CR13","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/s00291-011-0246-3","volume":"34","author":"M Kellner","year":"2012","unstructured":"Kellner M, Boysen N, Fliedner M (2012) How to park freight trains on rail\u2013rail transshipment yards: the train location problem. OR Spectr 34:535\u2013561","journal-title":"OR Spectr"},{"key":"446_CR14","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1057\/palgrave.jors.2600348","volume":"48","author":"E Kozan","year":"1997","unstructured":"Kozan E (1997) Increasing the operational efficiency of container terminals in Australia. J Oper Res Soc 48:151\u2013161","journal-title":"J Oper Res Soc"},{"key":"446_CR15","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C Miller","year":"1960","unstructured":"Miller C, Tucker A, Zemlin R (1960) Integer programming formulations and travelling salesman problems. J ACM 7:326\u2013329","journal-title":"J ACM"},{"key":"446_CR16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tre.2003.12.002","volume":"41","author":"E Nishimura","year":"2005","unstructured":"Nishimura E, Imai A, Papadimitriou S (2005) Yard trailer routing at a maritime container terminal. Transp Res Part E Logist Transp Rev 41:53\u201376","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"446_CR17","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.cie.2014.10.011","volume":"78","author":"B Otto","year":"2014","unstructured":"Otto B, Boysen N (2014) A dynamic programming based heuristic for locating stops in public transportation networks. Comput Ind Eng 78:163\u2013174","journal-title":"Comput Ind Eng"},{"key":"446_CR18","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-1-4757-2807-1_11","volume-title":"Advances in computational and stochastic optimization, logic programming, and heuristic search","author":"JY Potvin","year":"1998","unstructured":"Potvin JY, Guertin F (1998) A genetic algorithm for the clustered traveling salesman problem with a prespecified order on the clusters. Advances in computational and stochastic optimization, logic programming, and heuristic search. Springer, New York, pp 287\u2013299"},{"key":"446_CR19","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1080\/0308106042000273022","volume":"27","author":"H Rotter","year":"2004","unstructured":"Rotter H (2004) New operating concepts for intermodal transport: the mega hub in Hanover\/Lehrte in Germany. Transp Plan Technol 27:347\u2013365","journal-title":"Transp Plan Technol"},{"key":"446_CR20","doi-asserted-by":"crossref","unstructured":"Schaefer T (1978) The complexity of satisfiability problem. In: Proceedings of the 10th ACM symposium on theory of computing (STOC\u201978), pp 216\u2013226","DOI":"10.1145\/800133.804350"},{"key":"446_CR21","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00291-003-0157-z","volume":"26","author":"D Steenken","year":"2004","unstructured":"Steenken D, Vo\u00df S, Stahlbock R (2004) Container terminal operation and operations research\u2014a classification and literature review. OR Spectr 26:3\u201349","journal-title":"OR Spectr"},{"key":"446_CR22","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.ejor.2013.07.007","volume":"235","author":"K Tierney","year":"2013","unstructured":"Tierney K, Vo\u00df S, Stahlbock R (2013) A mathematical model of inter-terminal transportation. Eur J Oper Res 235:448\u2013460","journal-title":"Eur J Oper Res"},{"key":"446_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00293-X","volume":"147","author":"IF Vis","year":"2003","unstructured":"Vis IF, De Koster R (2003) Transshipment of containers at a container terminal: an overview. Eur J Oper Res 147:1\u201316","journal-title":"Eur J Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-016-0446-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-016-0446-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-016-0446-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-016-0446-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T11:00:07Z","timestamp":1559041207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-016-0446-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,21]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["446"],"URL":"https:\/\/doi.org\/10.1007\/s00291-016-0446-y","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,21]]}}}