{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:22:11Z","timestamp":1771460531641,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":[[1998,4]]},"DOI":"10.1016\/s0377-2217(97)00260-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"226-253","source":"Crossref","is-referenced-by-count":123,"title":["The flow shop with parallel machines: A tabu search approach"],"prefix":"10.1016","volume":"106","author":[{"given":"Eugeniusz","family":"Nowicki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Czeslaw","family":"Smutnicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00260-9_BIB1","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0377-2217(94)90333-6","article-title":"Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment","volume":"72","author":"Hunsucker","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00260-9_BIB2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0377-2217(91)90148-O","article-title":"Branch and bound algorithm for the flow shop with multiple processors","volume":"51","author":"Sbaukat","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00260-9_BIB3","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1057\/jors.1995.28","article-title":"Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel. machines at one stage","volume":"46","author":"Chen","year":"1995","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00260-9_BIB4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/asm.3150090206","article-title":"A scheduling algorithm for flexible flow lines with limited intermediated buffers","volume":"9","author":"Sawik","year":"1993","journal-title":"Applied Stochastic Models and Data Analysis"},{"key":"10.1016\/S0377-2217(97)00260-9_BIB5","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"},{"key":"10.1016\/S0377-2217(97)00260-9_BIB6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0360-8352(94)90025-6","article-title":"Heuristics for scheduling flexible flow lines","volume":"26","author":"Ding","year":"1994","journal-title":"Computers Industrial Engineering"},{"key":"10.1016\/S0377-2217(97)00260-9_BIB7","series-title":"Modern Heuristic Techniques for Combinatorial Problems","first-page":"70","article-title":"Tabu search","author":"Glover","year":"1993"},{"key":"10.1016\/S0377-2217(97)00260-9_BIB8","unstructured":"R.J.M. Vaessens, E.H.L. Aarts, J.K. Lenstra, Job shop scheduling by local search, Memorandum COSOR 94-05, Eidhoven University of Technology."},{"key":"10.1016\/S0377-2217(97)00260-9_BIB9","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future path for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Computer and Operations Research"},{"key":"10.1016\/S0377-2217(97)00260-9_BIB10","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search. Part 1","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00260-9_BIB11","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search. Part 11","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"issue":"6","key":"10.1016\/S0377-2217(97)00260-9_BIB12","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","volume":"42","author":"Nowicki","year":"1996","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/S0377-2217(97)00260-9_BIB13","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","article-title":"A fast taboo search algorithm for the flow shop","volume":"91","author":"Nowicki","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00260-9_BIB14","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0377-2217(90)90090-X","article-title":"Some efficient heuristic methods for flow shop sequencing","volume":"47","author":"Taillard","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00260-9_BIB15","series-title":"Progress in Combinatorial Optimization","first-page":"245","article-title":"Preemptive scheduling of uniform machines subject to release dates","author":"Labetoulle","year":"1984"},{"key":"10.1016\/S0377-2217(97)00260-9_BIB16","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02022565","article-title":"Hashing vectors for tabu search","volume":"41","author":"Woodruff","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00260-9_BIB17","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","article-title":"The reactive tabu search","volume":"6","author":"Battiti","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00260-9_BIB18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0377-2217(89)90208-7","article-title":"Scheduling algorithms for flexible flowshops: Worst and average case performance","volume":"43","author":"Sriskandarajah","year":"1989","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002609?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002609?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T12:56:10Z","timestamp":1556110570000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797002609"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221797002609"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00260-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}