{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:56:33Z","timestamp":1761486993745},"reference-count":27,"publisher":"Elsevier BV","issue":"13","license":[{"start":{"date-parts":[[2004,11,1]],"date-time":"2004-11-01T00:00:00Z","timestamp":1099267200000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,11]]},"DOI":"10.1016\/s0305-0548(03)00169-2","type":"journal-article","created":{"date-parts":[[2003,6,20]],"date-time":"2003-06-20T22:47:16Z","timestamp":1056149236000},"page":"2151-2164","source":"Crossref","is-referenced-by-count":37,"title":["A neuro-tabu search heuristic for the flow shop scheduling problem"],"prefix":"10.1016","volume":"31","author":[{"given":"M","family":"Solimanpur","sequence":"first","affiliation":[]},{"given":"P","family":"Vrat","sequence":"additional","affiliation":[]},{"given":"R","family":"Shankar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0305-0548(03)00169-2_BIB1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"10.1016\/S0305-0548(03)00169-2_BIB2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1057\/jors.1965.7","article-title":"A branch and bound algorithm for the exact solution of the three-machine scheduling problem","volume":"16","author":"Lomnicki","year":"1965","journal-title":"Operational Research Quarterly"},{"issue":"1","key":"10.1016\/S0305-0548(03)00169-2_BIB3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1057\/jors.1965.8","article-title":"Sequencing jobs through a multi-stage process in the minimum total time\u2014a quick method of obtaining a near optimum","volume":"16","author":"Palmer","year":"1965","journal-title":"Operational Research Quarterly"},{"issue":"B","key":"10.1016\/S0305-0548(03)00169-2_BIB4","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1287\/mnsc.16.10.B630","article-title":"A heuristic algorithm for the n-job, m-machine sequencing problem","volume":"16","author":"Campbell","year":"1970","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/S0305-0548(03)00169-2_BIB5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1057\/jors.1971.18","article-title":"A functional heuristic algorithm for the flow shop scheduling problem","volume":"22","author":"Gupta","year":"1971","journal-title":"Operational Research Quarterly"},{"issue":"11","key":"10.1016\/S0305-0548(03)00169-2_BIB6","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/mnsc.23.11.1174","article-title":"An evaluation of flow shop sequencing heuristics","volume":"23","author":"Dannenbring","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB7","first-page":"303","article-title":"Machine aggregation heuristics in shop scheduling","volume":"45","author":"R\u00f6ck","year":"1982","journal-title":"Methods of Operations Research"},{"issue":"1","key":"10.1016\/S0305-0548(03)00169-2_BIB8","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\/S0305-0548(03)00169-2_BIB9","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: International Journal of Management Science"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB10","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\/S0305-0548(03)00169-2_BIB11","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","article-title":"Simulated annealing for permutation flow shop scheduling","volume":"17","author":"Osman","year":"1989","journal-title":"OMEGA: International Journal of Management Science"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB12","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","article-title":"A new heuristic for the flow shop sequencing problem","volume":"41","author":"Widmer","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB13","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0377-2217(91)90080-F","article-title":"A new heuristic for the n-job, m-machine flow shop problem","volume":"52","author":"Ho","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0305-0548(90)90001-N","article-title":"The application of the simulated annealing algorithm to the solution of the n\/m\/Cmax flow shop problem","volume":"17","author":"Ogbu","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB15","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","article-title":"A fast tabu search algorithm for the permutation flow shop problem","volume":"91","author":"Nowicki","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB16","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0377-2217(97)00136-7","article-title":"A tabu search approach for the flow shop scheduling problem","volume":"109","author":"Ben-Daya","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB17","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB18","series-title":"Tabu search","author":"Glover","year":"1997"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0305-0548(00)00062-9","article-title":"Defining tabu list size and aspiration criterion within tabu search methods","volume":"29","author":"Salhi","year":"2002","journal-title":"Computers and Operations Research"},{"issue":"3","key":"10.1016\/S0305-0548(03)00169-2_BIB20","first-page":"773","article-title":"Exponential and chaotic neuro-dynamical tabu searches for quadratic assignment problems","volume":"29","author":"Hasegawa","year":"2000","journal-title":"Control and Cybernetics"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB21","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/S0377-2217(01)00189-8","article-title":"A novel chaotic search for quadratic assignment problems","volume":"139","author":"Hasegawa","year":"2002","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB22","doi-asserted-by":"crossref","first-page":"2344","DOI":"10.1103\/PhysRevLett.79.2344","article-title":"Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problem","volume":"79","author":"Hasegawa","year":"1997","journal-title":"Physical Review Letters"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB23","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\/S0305-0548(03)00169-2_BIB24","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search-part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB25","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0305-0483(91)90036-S","article-title":"Simulated annealing for the permutation flow-shop problem","volume":"19","author":"Ogbu","year":"1991","journal-title":"OMEGA: International Journal of Management Science"},{"issue":"1","key":"10.1016\/S0305-0548(03)00169-2_BIB26","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","article-title":"A genetic algorithm for flow shop sequencing","volume":"22","author":"Reeves","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00169-2_BIB27","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"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001692?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001692?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T07:54:00Z","timestamp":1553068440000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803001692"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,11]]},"references-count":27,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2004,11]]}},"alternative-id":["S0305054803001692"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00169-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,11]]}}}