{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T08:10:22Z","timestamp":1774771822629,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0167-6377(02)00147-5","type":"journal-article","created":{"date-parts":[[2002,10,16]],"date-time":"2002-10-16T21:46:23Z","timestamp":1034804783000},"page":"343-350","source":"Crossref","is-referenced-by-count":110,"title":["A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis"],"prefix":"10.1016","volume":"30","author":[{"given":"Yongpei","family":"Guan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-Qiang","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raymond K","family":"Cheung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-Lun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00147-5_BIB1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1002\/(SICI)1520-6750(199706)44:4<301::AID-NAV2>3.0.CO;2-A","article-title":"Optimizing submarine berthing with a persistence incentive","volume":"44","author":"Brown","year":"1997","journal-title":"Naval Res. Logist."},{"key":"10.1016\/S0167-6377(02)00147-5_BIB2","unstructured":"C.-Y. Chen, T.-W. Hsieh, A time-space network model for the berth allocation problem, First International Conference of Maritime Engineering and Ports, Genoa, Italy, September 28\u201330, 1998."},{"key":"10.1016\/S0167-6377(02)00147-5_BIB3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<57::AID-NAV4>3.0.CO;2-H","article-title":"General multiprocessor task scheduling","volume":"46","author":"Chen","year":"1999","journal-title":"Naval Res. Logist."},{"key":"10.1016\/S0167-6377(02)00147-5_BIB4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0191-2615(89)90001-5","article-title":"The crane scheduling problem","volume":"23B","author":"Daganzo","year":"1989","journal-title":"Transportation Res. B"},{"key":"10.1016\/S0167-6377(02)00147-5_BIB5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","article-title":"Scheduling multiprocessor tasks\u2014an overview","volume":"94","author":"Drozdowski","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00147-5_BIB6","doi-asserted-by":"crossref","unstructured":"S.P. Fekete, E. K\u00f6hler, J. Teich, Higher-dimensional packing with order constraints, Proceedings of the 7th International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 2125, Springer, Berlin, 2001, pp. 300\u2013312.","DOI":"10.1007\/3-540-44634-6_28"},{"key":"10.1016\/S0167-6377(02)00147-5_BIB7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0377-2217(93)E0278-6","article-title":"An exact algorithm for general, orthogonal, two-dimensional knapsack problems","volume":"83","author":"Hadjiconstantinou","year":"1995","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00147-5_BIB8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/atr.5670260105","article-title":"A study of container berth allocation","volume":"26","author":"Lai","year":"1992","journal-title":"J. Adv. Transportation"},{"key":"10.1016\/S0167-6377(02)00147-5_BIB9","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1080\/07408179908969847","article-title":"Scheduling one and two-processor tasks on two parallel processors","volume":"31","author":"Lee","year":"1999","journal-title":"IIE Trans."},{"key":"10.1016\/S0167-6377(02)00147-5_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018909801944","article-title":"Current trends in deterministic scheduling","volume":"70","author":"Lee","year":"1997","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00147-5_BIB11","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1080\/07408179808966484","article-title":"Scheduling with multiple-job-on-one-processor pattern","volume":"30","author":"Li","year":"1998","journal-title":"IIE Trans."},{"key":"10.1016\/S0167-6377(02)00147-5_BIB12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0167-6377(98)00010-8","article-title":"The berth planning problem","volume":"22","author":"Lim","year":"1998","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(02)00147-5_BIB13","series-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo","year":"2002"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001475?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001475?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T06:51:31Z","timestamp":1554619891000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0167637702001475"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00147-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}