{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T07:44:20Z","timestamp":1768808660985,"version":"3.49.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,4,12]],"date-time":"2006-04-12T00:00:00Z","timestamp":1144800000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1007\/s00291-006-0036-5","type":"journal-article","created":{"date-parts":[[2006,4,11]],"date-time":"2006-04-11T07:19:04Z","timestamp":1144739944000},"page":"495-518","source":"Crossref","is-referenced-by-count":180,"title":["Berth management in container terminal: the template design problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Rajeeva","family":"Moorthy","sequence":"first","affiliation":[]},{"given":"Chung-Piaw","family":"Teo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,4,12]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/1520-6750(199402)41:1<1::AID-NAV3220410102>3.0.CO;2-L","volume":"41","author":"GG Brown","year":"1994","unstructured":"Brown GG, Lawphongpanich S, Thurman KP (1994) Optimizing ship berthing. Nav Res Logist 41:1\u201315","journal-title":"Nav Res Logist"},{"key":"36_CR2","unstructured":"Chen CY, Hsieh TW (1999) A time\u2013space network model for the berth allocation problem. In: 19th IFIP TC7 conference on system modeling and optimization, Cambridge, England, 12\u201316 July 1999"},{"key":"36_CR3","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10107-003-0427-1","volume":"97","author":"S Imahori","year":"2003","unstructured":"Imahori S, Yagiura M, Ibaraki T (2003) Local search algorithms for the rectangle packing problem with general spatial costs. Math Program Ser B 97:543\u2013569","journal-title":"Math Program Ser B"},{"issue":"2\u20133","key":"36_CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0167-6377(98)00010-8","volume":"22","author":"A Lim","year":"1998","unstructured":"Lim A (1998) On the ship berthing problem. Oper Res Lett 22(2\u20133):105\u2013110","journal-title":"Oper Res Lett"},{"issue":"12","key":"36_CR5","doi-asserted-by":"crossref","first-page":"1518","DOI":"10.1109\/43.552084","volume":"15","author":"H Murata","year":"1996","unstructured":"Murata H, Fujiyoshi K, Nakatake S, Kajitani Y (1996) VLSI module placement based on rectangle packing by the sequence pair. IEEE Trans Comput-Aided Des Integr Circuits Syst 15(12):1518\u20131524","journal-title":"IEEE Trans Comput-Aided Des Integr Circuits Syst"},{"key":"36_CR6","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/43.673633","volume":"17","author":"H Murata","year":"1998","unstructured":"Murata H, Fujiyoshi K, Kaneko M (1998). VLSI\/PCB placement with obstacles based on sequence pair. IEEE Trans Comput-Aided Des Integr Circuits Syst 17:60\u201368","journal-title":"IEEE Trans Comput-Aided Des Integr Circuits Syst"},{"issue":"3","key":"36_CR7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.dss.2003.11.002","volume":"39","author":"KG Murty","year":"2005","unstructured":"Murty KG, Liu JY, Wan YW, Linn R (2005) A decision support system for operations in a container terminal. Decis Support Syst 39(3):309\u2013332","journal-title":"Decis Support Syst"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Tang X, Tian R, Wong DF (2000) Fast evaluation of sequence pair in block placement by longest common subsequence computation. In: Proceedings of the conference on design,, automation and test in Europe, pp 106\u2013111","DOI":"10.1145\/343647.343713"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-006-0036-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-006-0036-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-006-0036-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:54Z","timestamp":1559041194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-006-0036-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["36"],"URL":"https:\/\/doi.org\/10.1007\/s00291-006-0036-5","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4,12]]}}}