{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:08:27Z","timestamp":1759666107043},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,11,24]],"date-time":"2010-11-24T00:00:00Z","timestamp":1290556800000},"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":[[2012,8]]},"DOI":"10.1007\/s10951-010-0200-2","type":"journal-article","created":{"date-parts":[[2010,11,23]],"date-time":"2010-11-23T16:12:29Z","timestamp":1290528749000},"page":"499-511","source":"Crossref","is-referenced-by-count":23,"title":["New bounds and algorithms for the transshipment yard scheduling problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Nils","family":"Boysen","sequence":"first","affiliation":[]},{"given":"Florian","family":"Jaehn","sequence":"additional","affiliation":[]},{"given":"Erwin","family":"Pesch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,24]]},"reference":[{"key":"200_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s291-002-8197-3","volume":"24","author":"K. Alicke","year":"2002","unstructured":"Alicke, K. (2002). Modeling and optimization of the intermodal terminal mega hub. OR Spectrum, 24, 1\u201317.","journal-title":"OR Spectrum"},{"key":"200_CR2","first-page":"769","volume":"8","author":"K. Alicke","year":"1998","unstructured":"Alicke, K., & Arnold, D. (1998). Modellierung und Optimierung von mehrstufigen Umschlagsystemen. F\u00f6rdern und Heben, 8, 769\u2013772.","journal-title":"F\u00f6rdern und Heben"},{"key":"200_CR3","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/S0191-2615(01)00020-0","volume":"36","author":"A. Ballis","year":"2002","unstructured":"Ballis, A., & Golias, J. (2002). Comparative evaluation of existing and innovative rail\u2013road freight transport terminals. Transportation Research Part A: Policy and Practice, 36, 593\u2013611.","journal-title":"Transportation Research Part A: Policy and Practice"},{"key":"200_CR4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/PL00020912","volume":"49","author":"U. Blasum","year":"1999","unstructured":"Blasum, U., Bussieck, M., Hochst\u00e4ttler, W., Moll, C., Scheel, H.-H., & Winter, T. (1999). Scheduling trams in the morning. Mathematical Methods of Operations Research, 49, 137\u2013148.","journal-title":"Mathematical Methods of Operations Research"},{"key":"200_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0191-2615(02)00074-7","volume":"38","author":"Y. Bontekoning","year":"2004","unstructured":"Bontekoning, Y., Macharis, C., & Trip, J. (2004). Is a new applied transportation research field emerging? A review of intermodal rail-truck freight transport literature. Transportation Research Part A: Policy and Practice, 38, 1\u201324.","journal-title":"Transportation Research Part A: Policy and Practice"},{"key":"200_CR6","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1287\/trsc.32.4.370","volume":"32","author":"N. Bostel","year":"1998","unstructured":"Bostel, N., & Dejax, P. (1998). Models and algorithms for container allocation problems on trains in a rapid transshipment shunting yard. Transportation Science, 32, 370\u2013379.","journal-title":"Transportation Science"},{"key":"200_CR7","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. European Journal of Operational Research, 204, 336\u2013342.","journal-title":"European Journal of Operational Research"},{"key":"200_CR8","doi-asserted-by":"crossref","unstructured":"Boysen, N., Jaehn, F., & Pesch, E. (2010a). Scheduling freight trains in rail\u2013rail transshipment yards, Transportation Science, to apppear","DOI":"10.1287\/trsc.1100.0365"},{"key":"200_CR9","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1016\/j.tre.2010.05.004","volume":"46","author":"N. Boysen","year":"2010","unstructured":"Boysen, N., Fliedner, M., & Kellner, M. (2010b). Determining fixed crane areas in rail\u2013rail transshipment yards. Transportation Research Part E, 46, 1005\u20131016.","journal-title":"Transportation Research Part E"},{"key":"200_CR10","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1287\/trsc.32.4.380","volume":"32","author":"J.-F. Cordeau","year":"1998","unstructured":"Cordeau, J.-F., Toth, P., & Vigo, D. (1998). A survey of optimization models for train routing and scheduling. Transportation Science, 32, 380\u2013404.","journal-title":"Transportation Science"},{"key":"200_CR11","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/s00291-007-0112-5","volume":"30","author":"P. Corry","year":"2008","unstructured":"Corry, P., & Kozan, E. (2008). Optimised loading patterns for intermodal trains. OR Spectrum, 30, 721\u2013750.","journal-title":"OR Spectrum"},{"key":"200_CR12","series-title":"Transportation","first-page":"467","volume-title":"Handbooks in operations research and management science","author":"T. Crainic","year":"2007","unstructured":"Crainic, T., & Kim, K. (2007). Intermodal transport. In C. Barnhart & G. Laporte (Eds.), Transportation: Vol. 14. Handbooks in operations research and management science (pp.\u00a0467\u2013538). Amsterdam: North-Holland."},{"key":"200_CR13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0166-218X(99)00219-X","volume":"103","author":"E. Dahlhaus","year":"2000","unstructured":"Dahlhaus, E., Horak, P., Miller, M., & Ryan, J. (2000). Optimised loading patterns for intermodal trains. Discrete Applied Mathematics, 103, 41\u201354.","journal-title":"Discrete Applied Mathematics"},{"key":"200_CR14","unstructured":"EU (2007). Mitteilung der Kommission an den Rat und das europ\u00e4ische Parlament: Aufbau eines vorrangig f\u00fcr den G\u00fcterverkehr bestimmten Schienennetzes."},{"key":"200_CR15","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/opre.40.1.S170","volume":"40","author":"T. Feo","year":"1992","unstructured":"Feo, T., Goldschmidt, O., & Khellaf, M. (1992). One-half approximation algorithms for the k-partition problem. Operations Research, 40, 170\u2013173.","journal-title":"Operations Research"},{"key":"200_CR16","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1287\/trsc.1030.0076","volume":"39","author":"R. Freling","year":"2005","unstructured":"Freling, R., Lentink, R., Kroon, L., & Huisman, D. (2005). Shunting of passenger train units in a railway station. Transportation Science, 39, 261\u2013272.","journal-title":"Transportation Science"},{"key":"200_CR17","volume-title":"Computers and intractability: A\u00a0guide to the theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and intractability: A\u00a0guide to the theory of NP-completeness. New York: Freeman."},{"key":"200_CR18","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0377-2217(99)00383-5","volume":"124","author":"S. He","year":"2000","unstructured":"He, S., Song, R., & Chaudhry, S. (2000). Fuzzy dispatching model and genetic algorithms for railyards operations. European Journal of Operational Research, 124, 307\u2013331.","journal-title":"European Journal of Operational Research"},{"key":"200_CR19","doi-asserted-by":"crossref","unstructured":"Kellner, M., Boysen, N., & Fliedner, M. (2010). How to park freight trains on rail\u2013rail transshipment yards: The train location problem, submitted.","DOI":"10.1007\/s00291-011-0246-3"},{"key":"200_CR20","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/nav.20189","volume":"54","author":"A. Lim","year":"2007","unstructured":"Lim, A., Rodrigues, B., & Xu, Z. (2007). A m-parallel crane scheduling problem with a non-crossing constraint. Naval Research Logistics, 54, 115\u2013127.","journal-title":"Naval Research Logistics"},{"key":"200_CR21","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/S0377-2217(03)00161-9","volume":"153","author":"C. Macharis","year":"2004","unstructured":"Macharis, C., & Bontekoning, Y. (2004). Opportunities for or in intermodal freight transport research: A review. European Journal of Operational Research, 153, 400\u2013416.","journal-title":"European Journal of Operational Research"},{"key":"200_CR22","volume-title":"Entwicklung eines Simulationsprogramms f\u00fcr Umschlagterminals des Kombinierten Verkehrs","author":"P. Meyer","year":"1999","unstructured":"Meyer, P. (1999). Entwicklung eines Simulationsprogramms f\u00fcr Umschlagterminals des Kombinierten Verkehrs. Aachen: Shaker Verlag."},{"key":"200_CR23","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/nav.20121","volume":"53","author":"L. Moccia","year":"2006","unstructured":"Moccia, L., Cordeau, J., 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":"200_CR24","volume-title":"Combinatorial optimization: Algorithms and Complexity","author":"C. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C., & Steiglitz, K. (1982). Combinatorial optimization: Algorithms and Complexity. Prentice-Hall: Englewood Cliffs."},{"key":"200_CR25","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0166-218X(96)00123-0","volume":"76","author":"E. Pesch","year":"1997","unstructured":"Pesch, E., & Glover, F. (1997). TSP ejection chains. Discrete Applied Mathematics, 76, 165\u2013181.","journal-title":"Discrete Applied Mathematics"},{"key":"200_CR26","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. Transportation Planning and Technology, 27, 347\u2013365.","journal-title":"Transportation Planning and Technology"},{"key":"200_CR27","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10951-007-0029-5","volume":"10","author":"M. Sammarra","year":"2007","unstructured":"Sammarra, M., Cordeau, J., Laporte, G., & Monaco, M. (2007). A tabu search heuristic for the quay crane scheduling problem. Journal of Scheduling, 10, 327\u2013336.","journal-title":"Journal of Scheduling"},{"key":"200_CR28","volume-title":"Scheduling theory. Single-stage systems","author":"V. S. Tanaev","year":"1994","unstructured":"Tanaev, V. S., Gordon, V. S., & Shafransky, Y. M. (1994). Scheduling theory. Single-stage systems. Kluwer: Dordrecht."},{"key":"200_CR29","doi-asserted-by":"crossref","first-page":"5","DOI":"10.2307\/20713685","volume":"46","author":"B. Wiegmans","year":"2007","unstructured":"Wiegmans, B., Stekelenburg, D., Versteegt, C., & Bontekoning, Y. (2007). Modeling rail\u2013rail exchange operations: An analysis of conventional and new-generation terminals. Transportation Journal, 46, 5\u201320.","journal-title":"Transportation Journal"},{"key":"200_CR30","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1018907720194","volume":"96","author":"T. Winter","year":"2000","unstructured":"Winter, T., & Zimmermann, U. (2000). Real-time dispatch of trams in storage yards. Annals of Operations Research, 96, 287\u2013315.","journal-title":"Annals of Operations Research"},{"key":"200_CR31","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1057\/palgrave.jors.2602110","volume":"57","author":"Y. Zhu","year":"2006","unstructured":"Zhu, Y., & Lim, A. (2006). Crane scheduling with non-crossing constraints. Journal of Operational Research Society, 57, 1464\u20131471.","journal-title":"Journal of Operational Research Society"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0200-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0200-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0200-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T08:07:48Z","timestamp":1685866068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0200-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,24]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["200"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0200-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,24]]}}}