{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T12:41:38Z","timestamp":1774528898573,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1007\/bf02156631","type":"journal-article","created":{"date-parts":[[2005,9,16]],"date-time":"2005-09-16T06:37:58Z","timestamp":1126852678000},"page":"489-509","source":"Crossref","is-referenced-by-count":27,"title":["A comparison of local search methods for flow shop scheduling"],"prefix":"10.1007","volume":"63","author":[{"given":"Celia A.","family":"Glass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris N.","family":"Potts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02156631_CR1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","volume":"6","author":"E.H.L. Aarts","year":"1994","unstructured":"E.H.L. Aarts, P.J.M. van Laarhoven, J.K. Lenstra and N.L.J. Ulder, A computational study of local search algorithms for job shop scheduling, ORSA J. Comp. 6(1994)118\u2013125.","journal-title":"ORSA J. Comp."},{"key":"BF02156631_CR2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/ijoc.6.2.161","volume":"6","author":"E.J. Anderson","year":"1994","unstructured":"E.J. Anderson and M.C. Ferris, Genetic algorithms for combinatorial optimization: The assembly line balancing problem, ORSA J. Comp. 6(1994)161\u2013173.","journal-title":"ORSA J. Comp."},{"key":"BF02156631_CR3","first-page":"14","volume-title":"Proc. 2nd Int. Conf. on Genetic Algorithms","author":"J.E. Baker","year":"1987","unstructured":"J.E. Baker, Reducing bias an inefficiency in the selection algorithm, in:Proc. 2nd Int. Conf. on Genetic Algorithms, ed. J.J. Grefenstette (Lawrence Erlbaum Associates, Hillside, NJ, 1987) pp. 14\u201321."},{"key":"BF02156631_CR4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0305-0548(93)E0015-L","volume":"22","author":"F. Della Croce","year":"1995","unstructured":"F. Della Croce, R. Tadei and G. Volta, A genetic algorithm for the job shop problem, Comp. Oper. Res. 22(1995)15\u201324.","journal-title":"Comp. Oper. Res."},{"key":"BF02156631_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M. Dell'Amico","year":"1992","unstructured":"M. Dell'Amico and M. Trubian, Applying tabu-search to the job-shop scheduling problem, Ann. Oper. Res. 41(1992)231\u2013252.","journal-title":"Ann. Oper. Res."},{"key":"BF02156631_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0305-0548(93)E0016-M","volume":"22","author":"U. Dorndorf","year":"1995","unstructured":"U. Dorndorf and E. Pesch, Evolution based learning in a job shop scheduling environment, Comp. Oper. Res. 22(1995)25\u201340.","journal-title":"Comp. Oper. Res."},{"key":"BF02156631_CR7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G. Dueck","year":"1988","unstructured":"G. Dueck and T. Scheuer, Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing, J. Comp. Phys. 90(1988)161\u2013175.","journal-title":"J. Comp. Phys."},{"key":"BF02156631_CR8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90001-R","volume":"46","author":"R.W. Eglese","year":"1990","unstructured":"R.W. Eglese, Simulated annealing: A tool for operational research, Euro. J. Oper. Res. 46(1990)271\u2013281.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02156631_CR9","first-page":"225","volume-title":"Industrial Scheduling","author":"H. Fisher","year":"1963","unstructured":"H. Fisher and G.L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, in:Industrial Scheduling, ed. J.F. Muth and G.L. Thompson (Prentice-Hall, Englewood Cliffs, NJ, 1963) pp. 225\u2013251."},{"key":"BF02156631_CR10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey, D.S. Johnson and R. Sethi, The complexity of flowshop and jobshop scheduling, Math. Oper. Res. 1(1976)117\u2013129.","journal-title":"Math. Oper. Res."},{"key":"BF02156631_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0895-7177(94)90205-4","volume":"20","author":"C.A. Glass","year":"1994","unstructured":"C.A. Glass, C.N. Potts and P. Shade, Unrelated parallel machine scheduling using local search, Math. Comp. Mod. 20(1994)41\u201352.","journal-title":"Math. Comp. Mod."},{"key":"BF02156631_CR12","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"F. Glover, Future paths for integer programming and links to artificial intelligence, Comp. Oper. Res. 13(1986)533\u2013549.","journal-title":"Comp. Oper. Res."},{"key":"BF02156631_CR13","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover, Tabu search \u2014 Part I, ORSA J. Comp. 1(1989)190\u2013206.","journal-title":"ORSA J. Comp."},{"key":"BF02156631_CR14","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"F. Glover, Tabu search \u2014 Part II, ORSA J. Comp. 2(1990)4\u201332.","journal-title":"ORSA J. Comp."},{"key":"BF02156631_CR15","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F. Glover","year":"1990","unstructured":"F. Glover, Tabu search: A tutorial, Interfaces 20(1990)74\u201394.","journal-title":"Interfaces"},{"key":"BF02156631_CR16","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"D.E. Goldberg,Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, Reading, MA, 1989)."},{"key":"BF02156631_CR17","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0305-0548(91)90034-O","volume":"18","author":"A.M.A. Hariri","year":"1991","unstructured":"A.M.A. Hariri and C.N. Potts, Heuristics for scheduling unrelated parallel machine, Comp. Oper. Res. 18(1991)323\u2013331.","journal-title":"Comp. Oper. Res."},{"key":"BF02156631_CR18","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01531073","volume":"1","author":"A. Hertz","year":"1990","unstructured":"A. Hertz and D. de Werra, The tabu search metaheuristic: How we used it, Ann. Math. Art. Int. 1(1990)111\u2013121.","journal-title":"Ann. Math. Art. Int."},{"key":"BF02156631_CR19","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt, Jr. and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)671\u2013680.","journal-title":"Science"},{"key":"BF02156631_CR20","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1145\/321864.321872","volume":"22","author":"W.H. Kohler","year":"1975","unstructured":"W.H. Kohler and K. Steiglitz, Exact, approximate and guaranteed accuracy algorithms for the flow-shop problemn\/2\/F\/ $$\\bar F$$ , J. ACM 22(1975)106\u2013114.","journal-title":"J. ACM"},{"key":"BF02156631_CR21","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1287\/opre.22.3.629","volume":"22","author":"M.J. Krone","year":"1974","unstructured":"M.J. Krone and K. Steiglitz, Heuristic programming solution of a flowshop-scheduling problem, Oper. Res. 22(1974)629\u2013638.","journal-title":"Oper. Res."},{"key":"BF02156631_CR22","volume-title":"Resource constrained scheduling: An experimental investigation of heuristic scheduling techniques","author":"S. Lawrence","year":"1984","unstructured":"S. Lawrence, Resource constrained scheduling: An experimental investigation of heuristic scheduling techniques, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA (1984)."},{"key":"BF02156631_CR23","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02022092","volume":"21","author":"G.E. Liepins","year":"1989","unstructured":"G.E. Liepins and M.R. Hilliard, Genetic algorithms: Foundations and applications, Ann. Oper. Res. 21(1989)31\u201358.","journal-title":"Ann. Oper. Res."},{"key":"BF02156631_CR24","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582166","volume":"34","author":"M. Lundy","year":"1986","unstructured":"M. Lundy and A. Mees, Convergence of an annealing algorithm, Math. Progr. 34(1986)111\u2013124.","journal-title":"Math. Progr."},{"key":"BF02156631_CR25","series-title":"Working Paper","volume-title":"A controlled search simulated annealing method for the general jobshop scheduling problem","author":"H. Matsuo","year":"1988","unstructured":"H. Matsuo, C.J. Suh and R.S. Sullivan, A controlled search simulated annealing method for the general jobshop scheduling problem, Working Paper 03-44-88, Department of Management, University of Texas, Austin, TX (1988)."},{"key":"BF02156631_CR26","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","volume":"7","author":"H. M\u00fchenbein","year":"1988","unstructured":"H. M\u00fchenbein, M. Gorges-Schleuter and O. Kr\u00e4mer, Evolution algorithms in combinatorial optimization, Parallel Comp. 7(1988)65\u201385.","journal-title":"Parallel Comp."},{"key":"BF02156631_CR27","first-page":"474","volume-title":"Proc. 4th Int. Conf. on Genetic Algorithms","author":"R. Nakano","year":"1991","unstructured":"R. Nakano and T. Yamada, Conventional genetic algorithms for job shop problems, in:Proc. 4th Int. Conf. on Genetic Algorithms, ed. R.K. Belew and L.B. Booker (Morgan Kaufmann, San Mateo, CA, 1991) pp. 474\u2013479."},{"key":"BF02156631_CR28","volume-title":"A fast taboo search algorithm for the job shop problem, Preprint 8\/93","author":"E. Nowicki","year":"1993","unstructured":"E. Nowicki and C. Smutnicki, A fast taboo search algorithm for the job shop problem, Preprint 8\/93, Instytut Cybernetyki Technicznej, Politnechniki Wroclawskiej, Wroclaw (1993)."},{"key":"BF02156631_CR29","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0305-0548(90)90001-N","volume":"17","author":"F.A. Ogbu","year":"1990","unstructured":"F.A. Ogbu and D.K. Smith, The application of the simulated annealing algorithm to the solution of then|m|C max flowshop problem, Comp. Oper. Res. 17(1990)243\u2013253.","journal-title":"Comp. Oper. Res."},{"key":"BF02156631_CR30","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0305-0483(91)90036-S","volume":"19","author":"F.A. Ogbu","year":"1991","unstructured":"F.A. Ogbu and D.K. Smith, Simulated annealing for the permutation flowshop problem, Omega 19(1991)64\u201367.","journal-title":"Omega"},{"key":"BF02156631_CR31","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"I.H. Osman","year":"1989","unstructured":"I.H. Osman and C.N. Potts, Simulated annealing for permutation flow-shop scheduling, Omega 17(1989)551\u2013557.","journal-title":"Omega"},{"key":"BF02156631_CR32","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1057\/jors.1993.67","volume":"44","author":"C.R. Reeves","year":"1993","unstructured":"C.R. Reeves, Improving the efficiency of tabu search for machine sequencing problems, J. Oper. Res. Soc. 44(1993)375\u2013382.","journal-title":"J. Oper. Res. Soc."},{"key":"BF02156631_CR33","unstructured":"C.R. Reeves, A genetic algorithm for flowshop sequencing, Comp. Oper. Res. (1994), to appear."},{"key":"BF02156631_CR34","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E. Taillard","year":"1990","unstructured":"E. Taillard, Some efficient heuristic methods for the flow shop sequencing problem, Euro. J. Oper. Res. 47(1990)65\u201374.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02156631_CR35","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"E. Taillard, Benchmarks for basic scheduling problems, Euro. J. Oper. Res. 64(1993)278\u2013285.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02156631_CR36","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","volume":"6","author":"E. Taillard","year":"1994","unstructured":"E. Taillard, Parallel taboo search techniques for the job shop scheduling problem, ORSA J. Comp. 6(1994)108\u2013117.","journal-title":"ORSA J. Comp."},{"key":"BF02156631_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated Annealing: Theory and Applications","author":"P.J.M. Laarhoven van","year":"1987","unstructured":"P.J.M. van Laarhoven and E.H.L. Aarts,Simulated Annealing: Theory and Applications (Kluwer, Dordrecht, 1987)."},{"key":"BF02156631_CR38","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P.J.M. Laarhoven van","year":"1992","unstructured":"P.J.M. van Laarhoven, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by simulated annealing, Oper. Res. 40(1992)113\u2013125.","journal-title":"Oper. Res."},{"key":"BF02156631_CR39","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/0305-0548(93)90058-Q","volume":"20","author":"F. Werner","year":"1993","unstructured":"F. Werner, On the heuristic solution of the permutation flow shop problem by path algorithms, Comp. Oper. Res. 20(1993)707\u2013722.","journal-title":"Comp. Oper. Res."},{"key":"BF02156631_CR40","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","volume":"41","author":"M. Widner","year":"1989","unstructured":"M. Widner and A. Hertz, A new heuristic method for the flow shop sequencing problem, Euro. J. Oper. Res. 41(1989)186\u2013193.","journal-title":"Euro. J. Oper. Res."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02156631.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02156631\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02156631","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T12:17:23Z","timestamp":1557836243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02156631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["BF02156631"],"URL":"https:\/\/doi.org\/10.1007\/bf02156631","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}