{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T00:33:24Z","timestamp":1769042004098,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"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":[[2005,9]]},"DOI":"10.1007\/s10479-005-2444-3","type":"journal-article","created":{"date-parts":[[2005,8,29]],"date-time":"2005-08-29T22:51:26Z","timestamp":1125355886000},"page":"53-65","source":"Crossref","is-referenced-by-count":84,"title":["A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking"],"prefix":"10.1007","volume":"138","author":[{"given":"D\u00e9bora P.","family":"Ronconi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2444_CR1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/opre.48.1.177.12451","volume":"48","author":"I.N.K. Abadi","year":"2000","unstructured":"Abadi, I.N.K., N.G. Hall, and C. Sriskandarajah. (2000). \u201cMinimizing Cycle Time in a Blocking Flowshop.\u201d Operations Research 48, 177\u2013180.","journal-title":"Operations Research"},{"key":"2444_CR2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0925-5273(99)00104-8","volume":"70","author":"V. Caraffa","year":"2001","unstructured":"Caraffa, V., S. Ianes, T.P. Bagchi, and C. Sriskandarajah. (2001). \u201cMinimizing Makespan in a Flowshop Using Genetic Algorithms.\u201d International Journal of Production Economics 70, 101\u2013115.","journal-title":"International Journal of Production Economics"},{"key":"2444_CR3","doi-asserted-by":"crossref","first-page":"2875","DOI":"10.1080\/00207549308956905","volume":"31","author":"B.J. Berkley","year":"1993","unstructured":"Berkley, B.J. (1993). \u201cEffect of buffer capacity and sequencing rules on single-card kanban system performance.\u201d International Journal of Production Research 31, 2875\u20132893.","journal-title":"International Journal of Production Research"},{"key":"2444_CR4","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1287\/mnsc.21.9.989","volume":"21","author":"S.K. Dutta","year":"1975","unstructured":"Dutta, S.K. and A.A. Cunningham. (1975). \u201cSequencing Two-Machine Flow-Shops with Finite Intermediate Storage.\u201d Management Science 21, 989\u2013996.","journal-title":"Management Science"},{"key":"2444_CR5","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"P.C. Gilmore","year":"1964","unstructured":"Gilmore, P.C. and R.E. Gomory. (1964). \u201cSequencing a One State Variable Machine: A Solvable Case of the Traveling Salesman Problem.\u201d Operations Research 12, 655\u2013665.","journal-title":"Operations Research"},{"key":"2444_CR6","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/S0377-2217(99)00224-6","volume":"125","author":"J. Grabowski","year":"2000","unstructured":"Grabowski, J. and J. Pempera. (2000). \u201cSequencing of Jobs in Some Production System.\u201d European Journal of Operational Research125, 535\u2013550.","journal-title":"European Journal of Operational Research"},{"key":"2444_CR7","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"N.G. Hall","year":"1996","unstructured":"Hall N.G. and C. Sriskandarajah. (1996). \u201cA Survey of Machine Scheduling Problems with Blocking and No-wait in Process.\u201d Operations Research 44, 510\u2013525.","journal-title":"Operations Research"},{"key":"2444_CR8","doi-asserted-by":"crossref","first-page":"2085","DOI":"10.1080\/00207549008942855","volume":"28","author":"R. Leisten","year":"1990","unstructured":"Leisten, R. (1990). \u201cFlowshop Sequencing Problems with Limited Buffer Storage\u201d. International Journal of Prodution Research28, 2085\u20132100.","journal-title":"International Journal of Prodution Research"},{"key":"2444_CR9","first-page":"1972","volume":"12","author":"E.M. Levner","year":"1969","unstructured":"Levner, E.M. (1969). \u201cOptimal Planning of Parts Machining on a Number of Machines.\u201d Automation and Remote Control 12, 1972\u20131978.","journal-title":"Automation and Remote Control"},{"key":"2444_CR10","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1287\/opre.37.6.925","volume":"37","author":"S.T. McCormick","year":"1989","unstructured":"McCormick, S.T., M.L. Pinedo, S. Shenker, and B. Wolf. (1989). \u201cSequencing in an Assembly Line with Blocking to Minimize Cycle Time.\u201d Operations Research 37, 925\u2013936.","journal-title":"Operations Research"},{"key":"2444_CR11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., E.E. Enscore, and I. Ham. (1983). \u201cA Heuristic Algorithm for the m-Machine, n-Job Flow-shop Sequencing Problem.\u201d OMEGA 11, 91\u201395.","journal-title":"OMEGA"},{"key":"2444_CR12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0360-8352(99)00007-8","volume":"36","author":"B.A. Norman","year":"1999","unstructured":"Norman, B.A. (1999). \u201cScheduling Flowshops with Finite Buffers and Sequence-dependent Setup Times.\u201d Computers & Industrial Engineering 36, 163\u2013177.","journal-title":"Computers & Industrial Engineering"},{"key":"2444_CR13","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(98)00017-4","volume":"116","author":"E. Nowicki","year":"1999","unstructured":"Nowicki, E. (1999). \u201cThe Permutation Flow Shop with Buffers: A Tabu Search Approach.\u201d European Journal of Operational Research 116, 205\u2013219.","journal-title":"European Journal of Operational Research"},{"key":"2444_CR14","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/322203.322213","volume":"27","author":"C.H. Papadimitriou","year":"1980","unstructured":"Papadimitriou, C.H. and P.C. Kanellakis. (1980). \u201cFlowshop Scheduling with Limited Temporary Storage.\u201d Journal of the Association for Computing Machinery 27, 533\u2013549.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"2444_CR15","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M. (1995). Scheduling: Theory, Algorithms, and Systems. New Jersey: Prentice-Hall."},{"key":"2444_CR16","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1287\/mnsc.23.2.216","volume":"23","author":"S.S. Reddi","year":"1976","unstructured":"Reddi, S.S. (1976). Management Science 23, 216\u2013217.","journal-title":"Management Science"},{"key":"2444_CR17","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1057\/jors.1972.52","volume":"23","author":"S.S. Reddi","year":"1972","unstructured":"Reddi, S.S. and C.V. Ramamoorthy. (1972). \u201cFlowshop Sequencing Problem with No Wait in Process.\u201d Operational Research Quarterly 23, 323\u2013330.","journal-title":"Operational Research Quarterly"},{"key":"2444_CR18","unstructured":"Reklaitis, G.V. (1982). \u201cReview of Scheduling of Process Operations.\u201d AIChE Symposium Series 78, 119\u2013133."},{"key":"2444_CR19","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0925-5273(03)00065-3","volume":"87","author":"D.P. Ronconi","year":"2004","unstructured":"Ronconi, D.P. (2004). \u201cA Note on Constructive Heuristics for the Flowshop Problen with Blocking.\u201d International Journal of Production Economics 87, 39\u201348.","journal-title":"International Journal of Production Economics"},{"key":"2444_CR20","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1057\/palgrave.jors.2601220","volume":"52","author":"D.P. Ronconi","year":"2001","unstructured":"Ronconi, D.P. and V.A. Armentano. (2001). \u201cLower Bounding Schemes for Flowshops with Blocking In-Process.\u201d Journal of the Operational Research Society 52, 1289\u20131297.","journal-title":"Journal of the Operational Research Society"},{"key":"2444_CR21","doi-asserted-by":"crossref","first-page":"3465","DOI":"10.1080\/00207549608905100","volume":"34","author":"B. Sharadapriyadarshini","year":"1996","unstructured":"Sharadapriyadarshini, B. and C. Rajendran. (1996). \u201cFormulations and Heuristics for Scheduling in Buffer-constrained Flowshop and Flowline-based Manufacturing Cell with Different Buffer-space Requirements for Jobs: Part 1.\u201d International Journal of Production Research 34, 3465\u20133485.","journal-title":"International Journal of Production Research"},{"key":"2444_CR22","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0098-1354(81)87003-2","volume":"5","author":"I. Suhami","year":"1981","unstructured":"Suhami, I. and R.S.H. Mah. (1981). \u201cAn Implicit Enumeration Scheme for the Flowshop Problem with No Intermediate Storage.\u201d Computers and Chemical Engineering 5, 83\u201391.","journal-title":"Computers and Chemical Engineering"},{"key":"2444_CR23","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E. (1993). \u201cBenchmarks for Basic Scheduling Problems.\u201d European Journal of Operational Research 64, 278\u2013285.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2444-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-2444-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2444-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:59:34Z","timestamp":1559138374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-2444-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["2444"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-2444-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}