{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T11:05:55Z","timestamp":1768993555058,"version":"3.49.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"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":[[1999,7]]},"DOI":"10.1016\/s0377-2217(98)00017-4","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"205-219","source":"Crossref","is-referenced-by-count":88,"title":["The permutation flow shop with buffers: A tabu search approach"],"prefix":"10.1016","volume":"116","author":[{"given":"Eugeniusz","family":"Nowicki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00017-4_BIB1","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","article-title":"A survey of machine scheduling problems with blocking and no-wait in process","volume":"44","author":"Hall","year":"1996","journal-title":"Oper. Res."},{"key":"10.1016\/S0377-2217(98)00017-4_BIB2","doi-asserted-by":"crossref","first-page":"2085","DOI":"10.1080\/00207549008942855","article-title":"Flowshop sequencing problems with limited buffer storage","volume":"28","author":"Leistein","year":"1990","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(98)00017-4_BIB3","unstructured":"C. Smutnicki, Block approach for flow shop scheduling with storage constraints (Polish), Zeszyty Naukowe Politechniki \u015ala\u0327skiej, Ser. Automatyka 84 (1986) 223\u2013233"},{"key":"10.1016\/S0377-2217(98)00017-4_BIB4","unstructured":"C. Smutnicki, A two-machine flow shop scheduling problem with buffers, Technical Report PRE 19\/97, Technical University of Wroc\u0142aw"},{"key":"10.1016\/S0377-2217(98)00017-4_BIB5","first-page":"133","article-title":"On two-machine scheduling with release and due dates to minimize maximum lateness","volume":"17","author":"Grabowski","year":"1980","journal-title":"Opsearch"},{"key":"10.1016\/S0377-2217(98)00017-4_BIB6","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1057\/jors.1983.142","article-title":"On flow shop scheduling with release and due dates to minimize maximum lateness","volume":"34","author":"Grabowski","year":"1983","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(98)00017-4_BIB7","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","article-title":"A fast taboo search algorithm for the permutation flow shop problem","volume":"91","author":"Nowicki","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00017-4_BIB8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search. Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(98)00017-4_BIB9","unstructured":"F. Glover, M. Laguna, Tabu Search, Modern Heuristic Techniques for Combinatorial Problems, in: C. Reeves (Ed.), Blackwell Scientific Publishing, Oxford, 1993, pp. 70\u2013141"},{"key":"10.1016\/S0377-2217(98)00017-4_BIB10","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast taboo search algorithm for the job shop problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00017-4_BIB11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flow shop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"OMEGA International Journal of Management Science"},{"key":"10.1016\/S0377-2217(98)00017-4_BIB12","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00017-4_BIB13","unstructured":"OR library. Internet: http:\/\/mscmga.ms.ic.ac.uk\/info.html, Files flowshop1.txt, flowshop2.txt"},{"key":"10.1016\/S0377-2217(98)00017-4_BIB14","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1016\/0098-1354(90)80017-6","article-title":"Scheduling of serial multiproduct batch processes via simulated annealing","volume":"14","author":"Das","year":"1990","journal-title":"Computers & Chemical Engineering"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798000174?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798000174?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T19:51:18Z","timestamp":1555962678000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798000174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0377221798000174"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00017-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}