{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T21:05:44Z","timestamp":1774127144353,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,6,1]],"date-time":"2004-06-01T00:00:00Z","timestamp":1086048000000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,6]]},"DOI":"10.1016\/s0377-2217(02)00873-1","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T22:25:53Z","timestamp":1048631153000},"page":"380-401","source":"Crossref","is-referenced-by-count":84,"title":["A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities"],"prefix":"10.1016","volume":"155","author":[{"given":"Bagas","family":"Wardono","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yahya","family":"Fathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0377-2217(02)00873-1_BIB1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(02)00873-1_BIB2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0360-8352(99)00007-8","article-title":"Scheduling flowshops with finite buffers and sequence dependent setup times","volume":"36","author":"Norman","year":"1999","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(02)00873-1_BIB3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(98)00017-4","article-title":"The permutation flow shop with buffers: A tabu search approach","volume":"116","author":"Nowicki","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00873-1_BIB4","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0377-2217(97)00260-9","article-title":"The flow shop with parallel machines: A tabu search approach","volume":"106","author":"Nowicki","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00873-1_BIB5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/asm.3150090206","article-title":"A scheduling algorithm for flexible flow lines with limited intermediate buffers","volume":"9","author":"Sawik","year":"1993","journal-title":"Applied Stochastic Models and Data Analysis"},{"issue":"5","key":"10.1016\/S0377-2217(02)00873-1_BIB6","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1080\/00207549508930214","article-title":"Scheduling flexible flow lines with no in-process buffers","volume":"33","author":"Sawik","year":"1995","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(02)00873-1_BIB7","unstructured":"B. Wardono, Algorithms for the multi-stage parallel machine problem with buffer constraints, Ph.D. Dissertation, North Carolina State University, 2001"},{"key":"10.1016\/S0377-2217(02)00873-1_BIB8","unstructured":"B. Wardono, Y. Fathi, A tabu search algorithm for the multi-stage parallel machine problem with unlimited buffer capacities, Submitted for publication"},{"key":"10.1016\/S0377-2217(02)00873-1_BIB9","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/opre.36.3.445","article-title":"An adaptable scheduling algorithm for flexible flow lines","volume":"36","author":"Wittrock","year":"1988","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008731?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008731?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T12:54:34Z","timestamp":1553432074000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702008731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,6]]}},"alternative-id":["S0377221702008731"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00873-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,6]]}}}