{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:19:39Z","timestamp":1720696779089},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":[[1993,9]]},"DOI":"10.1007\/bf02023072","type":"journal-article","created":{"date-parts":[[2005,8,12]],"date-time":"2005-08-12T12:47:48Z","timestamp":1123850868000},"page":"139-156","source":"Crossref","is-referenced-by-count":21,"title":["A tabu search experience in production scheduling"],"prefix":"10.1007","volume":"41","author":[{"given":"J. Wesley","family":"Barnes","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Laguna","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02023072_CR1","doi-asserted-by":"crossref","unstructured":"J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Manag. Sci. 34(1988)","DOI":"10.1287\/mnsc.34.3.391"},{"key":"BF02023072_CR2","unstructured":"K.R. Baker,Introduction to Sequencing and Scheduling (Wiley, 1974)."},{"key":"BF02023072_CR3","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"K.R. Baker","year":"1990","unstructured":"K.R. Baker and G.D. Scudder, Sequencing with earliness and tardiness penalties: A review, Oper. Res. 38(1990)22\u201336.","journal-title":"Oper. Res."},{"key":"BF02023072_CR4","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.17.6.941","volume":"17","author":"E. Balas","year":"1969","unstructured":"E. Balas, Machine sequencing via disjunctive graphs: An implicit enumeration algorithm, Oper. Res. 17(1969)941\u2013957.","journal-title":"Oper. Res."},{"key":"BF02023072_CR5","doi-asserted-by":"crossref","unstructured":"J.W. Barnes and J. Brennan, An improved algorithm for scheduling jobs on identical machines, AIIE Trans. 9(1977).","DOI":"10.1080\/05695557708975117"},{"key":"BF02023072_CR6","doi-asserted-by":"crossref","unstructured":"J.W. Barnes and L. Vanston, Scheduling jobs with linear delay penalties and sequence dependent set-up costs, J. Oper. Res. 29(1981.","DOI":"10.1287\/opre.29.1.146"},{"key":"BF02023072_CR7","unstructured":"J.W. Barnes and M. Laguna, Solving the multiple-machine weighted flow time problem using tabu search, IIE Trans. (1992) in press."},{"key":"BF02023072_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S0305004100034095","volume":"55","author":"J. Beardwood","year":"1959","unstructured":"J. Beardwood, J.H. Halton and J.M. Hammersley, The shortest path through many points, Proc. Cambridge Phil. Soc. 55(1959)299\u2013327.","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"BF02023072_CR9","volume-title":"Theory of Scheduling","author":"R.W. Conway","year":"1970","unstructured":"R.W. Conway, W.L. Maxwell and L.W. Miller,Theory of Scheduling (Addison-Wesley, Reading, MA, 1970)."},{"key":"BF02023072_CR10","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BF01720782","volume":"11","author":"D. Werra de","year":"1989","unstructured":"D. de Werra and A. Hertz, Tabu search techniques: A tutorial and an application to neural networks, OR Spectrum 11(1989)132\u2013141.","journal-title":"OR Spectrum"},{"key":"BF02023072_CR11","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0305-0548(87)90043-8","volume":"14","author":"J. Evans","year":"1987","unstructured":"J. Evans, Structural analysis of local search heuristics in combinatorial optimization, Comp. Oper. Res. 14(1987)465\u2013477.","journal-title":"Comp. Oper. Res."},{"key":"BF02023072_CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.F. Feo","year":"1989","unstructured":"T.F. Feo and M. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Oper. Res. Lett. 8(1989)67\u201371.","journal-title":"Oper. Res. Lett."},{"key":"BF02023072_CR13","unstructured":"S. French,Sequencing and Scheduling (Ellis Horwood, 1982)."},{"key":"BF02023072_CR14","unstructured":"M. Gendreau, A. Hertz and G. Laporte, A tabu search heuristic for the vehicle routing problem, Centre de Recherche sur les Transports, publication #777 (June 1991)."},{"key":"BF02023072_CR15","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"F. Glover, Heuristics for integer programming using surrogate constraints, Dec. Sci. 8(1977)156\u2013166.","journal-title":"Dec. Sci."},{"key":"BF02023072_CR16","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":"BF02023072_CR17","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. Part I, ORSA J. Comput. 1(1989)190\u2013206.","journal-title":"ORSA J. Comput."},{"key":"BF02023072_CR18","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. Part II, ORSA J. Comput. 2(1990)4\u201332.","journal-title":"ORSA J. Comput."},{"key":"BF02023072_CR19","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"29","author":"F. Glover","year":"1990","unstructured":"F. Glover, Tabu search: A tutorial, Interfaces 29(1990)74\u201394.","journal-title":"Interfaces"},{"key":"BF02023072_CR20","doi-asserted-by":"crossref","unstructured":"F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search, Ann. Oper. Res. (1993), this volume.","DOI":"10.1007\/BF02078647"},{"key":"BF02023072_CR21","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":"BF02023072_CR22","unstructured":"M. Laguna, Tabu search primer, Graduate School of Business and Administration, University of Colorado at Boulder (March 1992)."},{"key":"BF02023072_CR23","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01471219","volume":"2","author":"M. Laguna","year":"1991","unstructured":"M. Laguna, J.W. Barnes and F. Glover, Tabu search methods for a single machine scheduling problem, J. Int. Manufacturing 2(1991)63\u201373.","journal-title":"J. Int. Manufacturing"},{"key":"BF02023072_CR24","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01471113","volume":"2","author":"M. Laguna","year":"1991","unstructured":"M. Laguna and J.L. Gonzalez-Velarde, A search heuristic for just-in-time scheduling in parallel machines, J. Int. Manufacturing 2(1991)253\u2013260.","journal-title":"J. Int. Manufacturing"},{"key":"BF02023072_CR25","unstructured":"M. Laguna, J.W. Barnes and F. Glover, Scheduling jobs with linear delay penalties and sequence dependent setup costs and times using tabu search, Appl. Int. (1992) in press."},{"key":"BF02023072_CR26","doi-asserted-by":"crossref","unstructured":"M. Laguna and F. Glover, Integrating target analysis and tabu search for improved scheduling systems, Exp. Syst. Appl. (1992) in press.","DOI":"10.1016\/0957-4174(93)90056-C"},{"key":"BF02023072_CR27","unstructured":"J. Lam, An efficient simulated annealing schedule, Ph.D. Dissertation, Report 8818. Department of Computer Science, Yale University (September 1988)."},{"key":"BF02023072_CR28","volume-title":"Sequencing and scheduling: Algorithms and complexity, Report BS-R8909","author":"E.L. Lawler","year":"1989","unstructured":"E.L. Lawler, J.K. Lenstra, A Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, Report BS-R8909, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands (1989)."},{"key":"BF02023072_CR29","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.24.4.611","volume":"24","author":"T.L. Morin","year":"1976","unstructured":"T.L. Morin and R.E. Marsten, Branch and bound strategies for dynamic programming, Oper. Res. 24(1976)611\u2013627.","journal-title":"Oper. Res."},{"key":"BF02023072_CR30","doi-asserted-by":"crossref","unstructured":"M.E. Nawaz, E. Enscore and I. Ham, A heuristic algorithm for them-machine,n-job flow shop sequencing problem, OMEGA 11(1983).","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"BF02023072_CR31","unstructured":"F. Semet and E. Taillard, Solving real-life vehicle routing problems efficiently using tabu search, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, ORWP 91\/03 (April 1991)."},{"key":"BF02023072_CR32","unstructured":"E. Taillard, Parallel taboo search technique for the job shop scheduling problem, Research Report ORWP 89\/11, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, D\u00e9partment de Math\u00e9matiques (July 1989)."},{"key":"BF02023072_CR33","volume-title":"Quelques heuristiques et r\u00e9sultats asymptotiques pour trois probl\u00e8mes d'optimisation combinatoire","author":"M. Troyon","year":"1988","unstructured":"M. Troyon, Quelques heuristiques et r\u00e9sultats asymptotiques pour trois probl\u00e8mes d'optimisation combinatoire, Th\u00e8se No. 754, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Switzerland (1988)."},{"key":"BF02023072_CR34","unstructured":"S. Tsubakitani and J.R. Evans, Optimizing tabu list size for the traveling salesman problem, College of Business Administration, University of Cincinnati (June 1991)."},{"key":"BF02023072_CR35","volume-title":"Job shop scheduling by simulated annealing, Report OSR8809","author":"P. Laarhoven van","year":"1988","unstructured":"P. van Laarhoven, E. Aarts and J. Lenstra, Job shop scheduling by simulated annealing, Report OSR8809, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands (1988)"},{"key":"BF02023072_CR36","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","volume":"41","author":"M. Widmer","year":"1989","unstructured":"M. Widmer and A. Hertz, A new method for the flow sequencing problem, Eur. J. Oper. Res. 41(1989)186\u2013193.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02023072_CR37","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1057\/jors.1991.9","volume":"24","author":"M. Widmer","year":"1991","unstructured":"M. Widmer, Job shop scheduling with tooling constraints: a tabu search approach, J. Oper. Res. Soc. 24(1991)75\u201382.","journal-title":"J. Oper. Res. Soc."},{"key":"BF02023072_CR38","doi-asserted-by":"crossref","unstructured":"D.L Woodruff and M.L. Spearman, Sequencing and batching for two classes of jobs with deadlines and setup times, J. Prod. Oper. Manag. Soc. (1992) in press.","DOI":"10.1111\/j.1937-5956.1992.tb00341.x"},{"key":"BF02023072_CR39","doi-asserted-by":"crossref","unstructured":"D.L Woodruff and E. Zemel, Hashing vectors for tabu search, Ann. Oper. Res. (1993), this volume.","DOI":"10.1007\/BF02022565"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023072.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02023072\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T04:43:02Z","timestamp":1683175382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02023072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF02023072"],"URL":"https:\/\/doi.org\/10.1007\/bf02023072","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}