{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T09:49:42Z","timestamp":1785318582454,"version":"3.55.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"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,10]]},"DOI":"10.1016\/s0377-2217(97)00213-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:48:22Z","timestamp":1027604902000},"page":"76-98","source":"Crossref","is-referenced-by-count":78,"title":["Heuristics for the flow line problem with setup costs"],"prefix":"10.1016","volume":"110","author":[{"given":"Roger Z.","family":"R\u00edos-Mercado","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan F.","family":"Bard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00213-0_BIB1","series-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo inedo","year":"1995"},{"issue":"1","key":"10.1016\/S0377-2217(97)00213-0_BIB2","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 The International Journal of Management Science"},{"issue":"2","key":"10.1016\/S0377-2217(97)00213-0_BIB3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","article-title":"A probabilistic heuristic for a computationally difficult set covering problem","volume":"8","author":"Feo","year":"1989","journal-title":"Operations Research Letters"},{"issue":"12","key":"10.1016\/S0377-2217(97)00213-0_BIB4","doi-asserted-by":"crossref","first-page":"1415","DOI":"10.1287\/mnsc.35.12.1415","article-title":"Flight scheduling and maintenance base planning","volume":"35","author":"Feo","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00213-0_BIB5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01471113","article-title":"A search heuristic for just-in-time scheduling in parallel machines","volume":"2","author":"Laguna","year":"1991","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"1","key":"10.1016\/S0377-2217(97)00213-0_BIB6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","article-title":"A randomized adaptive search procedure for the vehicle routing problem with time windows","volume":"7","author":"Kontoravdis","year":"1995","journal-title":"ORSA Journal on Computing"},{"issue":"2","key":"10.1016\/S0377-2217(97)00213-0_BIB7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0305-0483(92)90075-I","article-title":"Heuristics in flow shop scheduling with sequence- dependent setup times","volume":"20","author":"Simons","year":"1992","journal-title":"OMEGA The International Journal of Management Science"},{"key":"10.1016\/S0377-2217(97)00213-0_BIB8","article-title":"Optimization of the flow shop scheduling problem with setup times","author":"Rios-Mercado","year":"1997"},{"key":"10.1016\/S0377-2217(97)00213-0_BIB9","first-page":"445","article-title":"Sequencing and scheduling: Algorithms and complexity","author":"Lawler","year":"1993"},{"issue":"1","key":"10.1016\/S0377-2217(97)00213-0_BIB10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0377-2217(80)90069-7","article-title":"An adaptive branching rule for the permutation flow-shop problem","volume":"5","author":"Potts","year":"1980","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0377-2217(97)00213-0_BIB11","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/0377-2217(95)00352-5","article-title":"Two branch and bound algorithms for the permutation flow shop problem","volume":"90","author":"Carlier","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0377-2217(97)00213-0_BIB12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0305-0483(93)90055-P","article-title":"Scheduling heuristics for the n-job m-machine flow shop","volume":"21","author":"Sarin","year":"1993","journal-title":"OMEGA The International Journal of Management Science"},{"issue":"2","key":"10.1016\/S0377-2217(97)00213-0_BIB13","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","article-title":"A new heuristic method for the flow shop sequencing problem","volume":"41","author":"Widmer","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00213-0_BIB14","article-title":"A fast tabu search algorithm for the flow shop problem","author":"Nowicki","year":"1994"},{"issue":"1","key":"10.1016\/S0377-2217(97)00213-0_BIB15","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0305-0483(87)90054-5","article-title":"Comparison of heuristics for flow shop sequencing","volume":"15","author":"Turner","year":"1987","journal-title":"OMEGA The International Journal of Management Science"},{"issue":"5","key":"10.1016\/S0377-2217(97)00213-0_BIB16","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1080\/00207548208947793","article-title":"n jobs and m machines job-shop problems with sequence-dependent set-up times","volume":"20","author":"Gupta","year":"1982","journal-title":"International Journal of Production Research"},{"issue":"3","key":"10.1016\/S0377-2217(97)00213-0_BIB17","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1002\/nav.3800210311","article-title":"Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach","volume":"21","author":"Corwin","year":"1974","journal-title":"Naval Research Logistics Quarterly"},{"issue":"3","key":"10.1016\/S0377-2217(97)00213-0_BIB18","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0377-2217(86)90037-8","article-title":"The two-machine sequence dependent flowshop scheduling problem","volume":"24","author":"Gupta","year":"1986","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"10.1016\/S0377-2217(97)00213-0_BIB19","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1002\/1520-6750(198710)34:5<619::AID-NAV3220340503>3.0.CO;2-B","article-title":"A flow-shop with sequence-dependent additive setup times","volume":"34","author":"Szwarc","year":"1987","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"10.1016\/S0377-2217(97)00213-0_BIB20","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","article-title":"Some efficient heuristic methods for the flow shop sequencing problem","volume":"47","author":"Taillard","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00213-0_BIB21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptive search procedures","volume":"6","author":"Feo","year":"1995","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"10.1016\/S0377-2217(97)00213-0_BIB22","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1057\/jors.1993.67","article-title":"Improving the efficiency of tabu search for machine sequencing problems","volume":"44","author":"Reeves","year":"1993","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00213-0_BIB23","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","first-page":"361","article-title":"Branch and bound methods","author":"Balas","year":"1990"},{"issue":"1","key":"10.1016\/S0377-2217(97)00213-0_BIB24","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01584228","article-title":"A restricted Lagrangean approach to the traveling salesman problem","volume":"21","author":"Balas","year":"1981","journal-title":"Mathematical Programming"},{"issue":"2","key":"10.1016\/S0377-2217(97)00213-0_BIB25","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01585701","article-title":"An additive bounding procedure for the asymmetric traveling salesman problem","volume":"53","author":"Fischetti","year":"1992","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00213-0_BIB26","series-title":"The Traveling Salesman Problem","first-page":"207","article-title":"Empirical analysis of heuristics","author":"Golden","year":"1990"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002130?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002130?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T08:58:03Z","timestamp":1556096283000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797002130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0377221797002130"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00213-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}