{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:50:35Z","timestamp":1726033835633},"reference-count":19,"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\/bf02023076","type":"journal-article","created":{"date-parts":[[2005,8,12]],"date-time":"2005-08-12T08:47:48Z","timestamp":1123836468000},"page":"231-252","source":"Crossref","is-referenced-by-count":385,"title":["Applying tabu search to the job-shop scheduling problem"],"prefix":"10.1007","volume":"41","author":[{"given":"Mauro","family":"Dell'Amico","sequence":"first","affiliation":[]},{"given":"Marco","family":"Trubian","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02023076_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job-shop scheduling, Manag. Sci. 34(1988)391\u2013401.","journal-title":"Manag. Sci."},{"key":"BF02023076_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1990","unstructured":"D. Applegate and W. Cook, A computational study of the job-shop scheduling problem, ORSA J. Comput. 3(1990)149\u2013156.","journal-title":"ORSA J. Comput."},{"key":"BF02023076_CR3","unstructured":"P. Brucker, B. Jurisch and B. Sievers, A fast branch and bound algorithm for the job-shop scheduling problem, Internal Report 136, Fachbereich Mathematik\/Informatik, Universit\u00e4t Osnabr\u00fcck (1991)."},{"key":"BF02023076_CR4","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"J. Carlier and E. Pinson, An algorithm for solving the job-shop problem, Manag. Sci. 35(1989)164\u2013176.","journal-title":"Manag. Sci."},{"key":"BF02023076_CR5","series-title":"Internal Report","volume-title":"A GRASP for single machine scheduling with due dates and earliness penalties","author":"T. Feo","year":"1989","unstructured":"T. Feo, K. Venkatraman and J.F. Bard, A GRASP for single machine scheduling with due dates and earliness penalties, Internal Report, OR Group, Department of Mechanical Engineering, University of Texas, Austin, TX (1989)."},{"key":"BF02023076_CR6","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":"BF02023076_CR7","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":"BF02023076_CR8","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":"BF02023076_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discr. Math. 5(1979)287\u2013326.","journal-title":"Ann. Discr. Math."},{"key":"BF02023076_CR10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"J.P. Hart","year":"1987","unstructured":"J.P. Hart and A.W. Shogan, Semi-greedy heuristics: an empirical study, Oper. Res. Lett. 6(1987)107\u2013114.","journal-title":"Oper. Res. Lett."},{"key":"BF02023076_CR11","unstructured":"S. Lawrence, Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques, GSIA, Carnegie-Mellon University (1984)."},{"key":"BF02023076_CR12","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, Graduate School of Business, University of Texas, Austin, TX (1988)."},{"key":"BF02023076_CR13","volume-title":"Industrial Scheduling","author":"J.F. Muth","year":"1963","unstructured":"J.F. Muth and G.L. Thompson,Industrial Scheduling (Prentice-Hall, Englewood Cliffs, 1963)."},{"key":"BF02023076_CR14","unstructured":"R. Nakano and T. Yamada, Conventional genetic algorithm for job shop problems,Proc. 4th Int. Conf. on Geneting Algorithms, San Diego, CA (1991) pp. 474\u2013479."},{"key":"BF02023076_CR15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"S.S. Panwalker","year":"1977","unstructured":"S.S. Panwalker and W. Iskander, A survey of scheduling rules, Oper. Res. 25(1977)45\u201361.","journal-title":"Oper. Res."},{"key":"BF02023076_CR16","unstructured":"B. Roy and B. Sussmann, Les Probl\u00e8mes d'ordonnancement avec contraintes disjonctives, Note DS n.9 bis, SEMA, Montrouge (1964)."},{"key":"BF02023076_CR17","series-title":"Internal Report ORWP","volume-title":"Parallel taboo search technique for the jobshop scheduling problem","author":"E. Taillard","year":"1989","unstructured":"E. Taillard, Parallel taboo search technique for the jobshop scheduling problem, Internal Report ORWP 89\/11, D\u00e9partment de Math\u00e9matiques, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne (1989)."},{"key":"BF02023076_CR18","series-title":"Report","volume-title":"Job shop scheduling by simulated annealing","author":"P.J.M. Laahroven van","year":"1988","unstructured":"P.J.M. van Laahroven, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by simulated annealing, Report OS-R8809, Centre for Mathematics and Computer Science, Amsterdam (1988)."},{"key":"BF02023076_CR19","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S.M. Johnson","year":"1954","unstructured":"S.M. Johnson, Optimal two- and three-stage production schedules with setup times included, Naval Res. Logist. Quart. 1(1954)61\u201368.","journal-title":"Naval Res. Logist. Quart."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023076.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02023076\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T18:39:57Z","timestamp":1557772797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02023076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF02023076"],"URL":"https:\/\/doi.org\/10.1007\/bf02023076","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}