{"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":1773453245261,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,9,17]],"date-time":"2011-09-17T00:00:00Z","timestamp":1316217600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10479-011-0971-7","type":"journal-article","created":{"date-parts":[[2011,9,16]],"date-time":"2011-09-16T14:19:14Z","timestamp":1316182754000},"page":"3-25","source":"Crossref","is-referenced-by-count":24,"title":["Optimal solutions for a dock assignment problem with trailer transportation"],"prefix":"10.1007","volume":"213","author":[{"given":"Lotte","family":"Berghman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roel","family":"Leus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,17]]},"reference":[{"key":"971_CR1","series-title":"Control systems, robotics and manufacturing series","doi-asserted-by":"crossref","DOI":"10.1002\/9780470611227","volume-title":"Resource-constrained project scheduling","author":"C. Artigues","year":"2008","unstructured":"Artigues, C., Demassey, S., & N\u00e9ron, E. (2008). Control systems, robotics and manufacturing series. Resource-constrained project scheduling. London: ISTE Ltd."},{"key":"971_CR2","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1002\/nav.20118","volume":"53","author":"J. F. Bard","year":"2006","unstructured":"Bard, J. F., & Rojanasoonthon, S. (2006). A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities. Naval Research Logistics, 53, 24\u201344.","journal-title":"Naval Research Logistics"},{"key":"971_CR3","unstructured":"Berghman, L., Leus, R., & Spieksma, F. C. R. (2010). Optimal solutions for a dock assignment problem with trailer transportation (Working Paper KBI-1010). Department of Decision Sciences and Information Management (KBI), Faculty of Business and Economics, KULeuven, Leuven (Belgium)."},{"key":"971_CR4","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.ejor.2009.05.031","volume":"202","author":"C. Bierwirth","year":"2010","unstructured":"Bierwirth, C., & Meisel, F. (2010). A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 202, 615\u2013627.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"971_CR5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/ijoc.1070.0225","volume":"20","author":"L. Bigras","year":"2008","unstructured":"Bigras, L., Gamache, M., & Savard, G. (2008). Time-indexed formulations and the total weighted tardiness problem. INFORMS Journal on Computing, 20(1), 133\u2013142.","journal-title":"INFORMS Journal on Computing"},{"key":"971_CR6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1002\/nav.1024","volume":"48","author":"E. K. Bish","year":"2001","unstructured":"Bish, E. K., Leong, T., Li, C., Ng, J. W. C., & Simchi-Levi, D. (2001). Analysis of a new vehicle scheduling and location problem. Naval Research Logistics, 48, 363\u2013385.","journal-title":"Naval Research Logistics"},{"key":"971_CR7","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s00291-004-0194-2","volume":"27","author":"E. K. Bish","year":"2005","unstructured":"Bish, E. K., Chen, F. Y., Leong, Y. T., Nelson, B. L., Ng, J. W. C., & Simchi-Levi, D. (2005). Dispatching vehicles in a mega container terminal. OR-Spektrum, 27, 491\u2013506.","journal-title":"OR-Spektrum"},{"key":"971_CR8","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0377-2217(91)90304-E","volume":"51","author":"J. Blazewicz","year":"1991","unstructured":"Blazewicz, J., Dror, M., & Weglarz, J. (1991). Mathematical programming formulations for machinery scheduling: a\u00a0survey. European Journal of Operational Research, 51, 283\u2013300.","journal-title":"European Journal of Operational Research"},{"key":"971_CR9","first-page":"1","volume-title":"Proceedings of the 33rd Hawaii international conference on system sciences","author":"J. B\u00f6se","year":"2000","unstructured":"B\u00f6se, J., Reiners, T., Steenken, D., & Voss, S. (2000). Vehicle dispatching at seaport container terminals using evolutionary algorithms. In Proceedings of the 33rd Hawaii international conference on system sciences (pp. 1\u201310)."},{"key":"971_CR10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s00291-008-0139-2","volume":"32","author":"N. Boysen","year":"2010","unstructured":"Boysen, N., Fliedner, M., & Scholl, A. (2010). Scheduling inbound and outbound trucks at cross docking terminals. OR-Spektrum, 32, 135\u2013161.","journal-title":"OR-Spektrum"},{"key":"971_CR11","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00170-006-0607-2","volume":"34","author":"J. S. Chen","year":"2007","unstructured":"Chen, J. S., Pan, J. C. H., & Wu, C. K. (2007). Minimizing makespan in reentrant flow-shops using hybrid tabu search. The International Journal of Advanced Manufacturing Technology, 34, 353\u2013361.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"971_CR12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","volume":"47","author":"T. C. E. Cheng","year":"1990","unstructured":"Cheng, T. C. E., & Sin, C. C. S. (1990). A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47, 271\u2013292.","journal-title":"European Journal of Operational Research"},{"key":"971_CR13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10479-008-0493-0","volume":"180","author":"C. Y. Cheong","year":"2010","unstructured":"Cheong, C. Y., Tan, K. C., Liu, D. K., & Lin, C. J. (2010). Multi-objective and prioritized berth allocation in container ports. Annals of Operations Research, 180, 63\u2013103.","journal-title":"Annals of Operations Research"},{"key":"971_CR14","doi-asserted-by":"crossref","first-page":"1684","DOI":"10.1016\/j.cor.2006.09.028","volume":"35","author":"S. W. Choi","year":"2008","unstructured":"Choi, S. W., & Kim, Y. D. (2008). Minimizing makespan on an m-machine re-entrant flowshop. Computers & Operations Research, 35, 1684\u20131696.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"971_CR15","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","volume":"29","author":"N. Christofides","year":"1987","unstructured":"Christofides, N., Alvarez-Vald\u00e9s, R., & Tamarit, J. M. (1987). Project scheduling with resource constraints: a\u00a0branch-and-bound approach. European Journal of Operational Research, 29(3), 262\u2013273.","journal-title":"European Journal of Operational Research"},{"key":"971_CR16","first-page":"207","volume":"72","author":"Y. Crama","year":"1996","unstructured":"Crama, Y., & Spieksma, F. C. R. (1996). Scheduling jobs of equal length: complexity, facets and computational results. Mathematical Programming, 72, 207\u2013227.","journal-title":"Mathematical Programming"},{"key":"971_CR17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01158636","volume":"12","author":"Y. Dallery","year":"1992","unstructured":"Dallery, Y., & Gershwin, S. B. (1992). Manufacturing flow line systems: a review of models and analytical results. Queueing Systems, 12, 3\u201394.","journal-title":"Queueing Systems"},{"issue":"4","key":"971_CR18","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/S0360-8352(98)00105-3","volume":"34","author":"M. M. Dessouky","year":"1998","unstructured":"Dessouky, M. M. (1998). Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness. Computers and Industrial Engineering, 34(4), 793\u2013806.","journal-title":"Computers and Industrial Engineering"},{"key":"971_CR19","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","volume":"26","author":"M.\u00a0E. Dyer","year":"1990","unstructured":"Dyer, M.\u00a0E., & Wolsey, L. A. (1990). Formulating the single machine sequencing problem with release dates as a mixed integer problem. Discrete Applied Mathematics, 26, 255\u2013270.","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"971_CR20","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0272-6963(83)90004-9","volume":"3","author":"S. C. Graves","year":"1983","unstructured":"Graves, S. C., Meal, H. C., Stefeka, D., & Zeghmi, A.\u00a0H. (1983). Scheduling of re-entrant flow shops. Journal of Operations Management, 3(4), 197\u2013207.","journal-title":"Journal of Operations Management"},{"key":"971_CR21","author":"Y. Guan","year":"2010","unstructured":"Guan, Y., Yang, K. H., & Zhou, Z. (2010). The crane scheduling problem: models and solution approaches. Annals of Operations Research. doi: 10.1007\/s10479-010-0765-3 .","journal-title":"Annals of Operations Research"},{"key":"971_CR22","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1016\/S0305-0548(01)00040-5","volume":"29","author":"J. N. C. Gupta","year":"2002","unstructured":"Gupta, J. N. C., Kr\u00fcger, K., Lauff, V., Werner, F., & Sotskov, Y. N. (2002). Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Computers & Operations Research, 29, 1417\u20131439.","journal-title":"Computers & Operations Research"},{"key":"971_CR23","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1018976827443","volume":"69","author":"J. N. D. Gupta","year":"1997","unstructured":"Gupta, J. N. D., Hairiri, A.\u00a0M.\u00a0A., & Potts, C. N. (1997). Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Annals of Operations Research, 69, 171\u2013191.","journal-title":"Annals of Operations Research"},{"key":"971_CR24","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s00186-006-0066-4","volume":"64","author":"M. Haouari","year":"2006","unstructured":"Haouari, M., Hidri, L., & Gharbi, A. (2006). Optimal scheduling of a two-stage hybrid flow shop. Mathematical Methods of Operations Research, 64, 107\u2013124.","journal-title":"Mathematical Methods of Operations Research"},{"key":"971_CR25","unstructured":"ILOG (2008). ILOG. CPLEX, 11, 0 user\u2019s manual. ILOG, Inc., available online at http:\/\/www.decf.berkeley.edu\/help\/apps\/ampl\/cplex-doc\/ ."},{"issue":"4","key":"971_CR26","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V. Jain","year":"2001","unstructured":"Jain, V., & Grossmann, I. E. (2001). Algorithms for hybrid MILP\/CP models for a class of optimization problems. INFORMS Journal on Computing, 13(4), 258\u2013276.","journal-title":"INFORMS Journal on Computing"},{"key":"971_CR27","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1016\/j.ejor.2006.05.052","volume":"189","author":"S. Kedad-Sidhoum","year":"2008","unstructured":"Kedad-Sidhoum, S., Solis, Y. R., & Sourd, F. (2008). Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates. European Journal of Operational Research, 189, 1305\u20131316.","journal-title":"European Journal of Operational Research"},{"key":"971_CR28","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2003.12.026","volume":"164","author":"T. Kis","year":"2005","unstructured":"Kis, T., & Pesch, E. (2005). A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. European Journal of Operational Research, 164, 592\u2013608.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"971_CR29","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1080\/07408179108963836","volume":"23","author":"H. Kise","year":"1991","unstructured":"Kise, H., Shioyama, T., & Ibaraki, T. (1991). Automated two-machine flow-shop scheduling: a solvable case. IIE Transactions, 23(1), 10\u201316.","journal-title":"IIE Transactions"},{"key":"971_CR30","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J. K. Lenstra","year":"1977","unstructured":"Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"971_CR31","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0360-8352(99)00023-6","volume":"37","author":"R. Linn","year":"1999","unstructured":"Linn, R., & Zhang, W. (1999). Hybrid flow shop scheduling: a survey. Computers and Industrial Engineering, 37, 57\u201361.","journal-title":"Computers and Industrial Engineering"},{"key":"971_CR32","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.ejor.2008.03.043","volume":"179","author":"R. Mellouli","year":"2009","unstructured":"Mellouli, R., Sadfi, C., Chu, C., & Kacem, I. (2009). Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times. European Journal of Operational Research, 179, 1150\u20131165.","journal-title":"European Journal of Operational Research"},{"key":"971_CR33","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.ejor.2007.09.031","volume":"192","author":"Z. Miao","year":"2009","unstructured":"Miao, Z., Lim, A., & Ma, H. (2009). Truck dock assignment problem with operational time constraint within crossdocks. European Journal of Operational Research, 192, 105\u2013115.","journal-title":"European Journal of Operational Research"},{"key":"971_CR34","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0925-5273(99)00051-1","volume":"64","author":"O. Moursli","year":"2000","unstructured":"Moursli, O., & Pochet, Y. (2000). A branch-and-bound algorithm for the hybrid flowshop. International Journal of Production Economics, 64, 113\u2013125.","journal-title":"International Journal of Production Economics"},{"key":"971_CR35","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.cor.2009.04.008","volume":"37","author":"T. Nichi","year":"2010","unstructured":"Nichi, T., Hiranaka, Y., & Inuiguchi, M. (2010). Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness. Computers & Operations Research, 37, 189\u2013198.","journal-title":"Computers & Operations Research"},{"key":"971_CR36","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0257-2","volume":"164","author":"C. D. Paternina-Arboleda","year":"2008","unstructured":"Paternina-Arboleda, C. D., Montoya-Torres, J. R., Acero-Domingues, M. J., & Herrera-Hernandez, M. C. (2008). Scheduling jobs on a k-stage flexible flow-shop. Annals of Operations Research, 164, 29\u201340.","journal-title":"Annals of Operations Research"},{"key":"971_CR37","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","volume":"37","author":"I. Ribas","year":"2010","unstructured":"Ribas, I., Leisten, R., & Frami\u00f1an, J. M. (2010). Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Computers & Operations Research, 37, 1439\u20131454.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"971_CR38","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/ijoc.1040.0110","volume":"18","author":"R. Sadykov","year":"2006","unstructured":"Sadykov, R., & Wolsey, L. A. (2006). Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates. INFORMS Journal on Computing, 18(2), 209\u2013217.","journal-title":"INFORMS Journal on Computing"},{"key":"971_CR39","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01586059","volume":"54","author":"J. P. Sousa","year":"1992","unstructured":"Sousa, J. P., & Wolsey, L. A. (1992). A time indexed formulation of non-preemptive single machine scheduling problems. Mathematical Programming, 54, 353\u2013367.","journal-title":"Mathematical Programming"},{"key":"971_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00291-007-0100-9","volume":"30","author":"R. Stahlbock","year":"2008","unstructured":"Stahlbock, R., & Vo\u00df, S. (2008). Operations research at container terminals: a\u00a0literature update. OR-Spektrum, 30, 1\u201352.","journal-title":"OR-Spektrum"},{"key":"971_CR41","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1057\/palgrave.jors.2602033","volume":"57","author":"L. Tang","year":"2006","unstructured":"Tang, L., & Xuan, H. (2006). Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers. The Journal of the Operational Research Society, 57, 316\u2013324.","journal-title":"The Journal of the Operational Research Society"},{"key":"971_CR42","unstructured":"Uetz, M. (2001). Algorithms for deterministic and stochastic scheduling. PhD thesis, Technische Universit\u00e4t Berlin, Germany."},{"key":"971_CR43","unstructured":"van\u00a0den Akker, J. M. (1994). LP-based solution methods for single-machine scheduling problems. PhD thesis, Technische Universiteit Eindhoven, the Netherlands."},{"issue":"2","key":"971_CR44","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/ijoc.12.2.111.11896","volume":"12","author":"J. M. Akker van\u00a0den","year":"2000","unstructured":"van\u00a0den Akker, J. M., Hurkens, C.\u00a0A.\u00a0J., & Savelsbergh, M. W. P. (2000). Time-indexed formulations for machine scheduling problems: column generation. INFORMS Journal on Computing, 12(2), 111\u2013124.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"971_CR45","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1051\/ro:1999108","volume":"33","author":"A. Vignier","year":"1999","unstructured":"Vignier, A., Billaut, J. C., & Proust, C. (1999). Hybrid flowshop scheduling problems: state of the art. RAIRO Operations Research, 33(2), 117\u2013183.","journal-title":"RAIRO Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0971-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0971-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0971-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:08Z","timestamp":1559153288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0971-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,17]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["971"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0971-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,17]]}}}