{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T07:40:19Z","timestamp":1780990819467,"version":"3.54.1"},"reference-count":38,"publisher":"Elsevier BV","issue":"12","content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1016\/j.cor.2013.06.010","type":"journal-article","created":{"date-parts":[[2013,7,5]],"date-time":"2013-07-05T01:36:41Z","timestamp":1372988201000},"page":"2864-2877","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":74,"title":["An integrated search heuristic for large-scale flexible job shop scheduling problems"],"prefix":"10.1016","volume":"40","author":[{"given":"Yuan","family":"Yuan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hua","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.cor.2013.06.010_bib1","first-page":"39","article-title":"Ant system for job-shop scheduling","volume":"34","author":"Colorni","year":"1994","journal-title":"Belgian Journal of Operations Research, Statistics and Computer Science"},{"key":"10.1016\/j.cor.2013.06.010_bib2","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1023\/A:1018934507395","article-title":"Applying constraint satisfaction techniques to job shop scheduling","volume":"70","author":"Cheng","year":"1997","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.1016\/j.cor.2013.06.010_bib3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","article-title":"An advanced tabu search algorithm for the job shop problem","volume":"8","author":"Nowicki","year":"2005","journal-title":"Journal of Scheduling"},{"issue":"4","key":"10.1016\/j.cor.2013.06.010_bib4","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1016\/j.cor.2006.07.003","article-title":"Ant colony optimization combined with taboo search for the job shop scheduling problem","volume":"35","author":"Huang","year":"2008","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.cor.2013.06.010_bib5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.1100.0388","article-title":"Combining constraint programming and local search for job-shop scheduling","volume":"23","author":"Beck","year":"2011","journal-title":"INFORMS Journal on Computing"},{"issue":"10","key":"10.1016\/j.cor.2013.06.010_bib6","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1016\/j.cor.2011.12.005","article-title":"A new hybrid genetic algorithm for job shop scheduling problem","volume":"39","author":"Qing-dao-er-ji","year":"2012","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cor.2013.06.010_bib7","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"10.1016\/j.cor.2013.06.010_bib8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","article-title":"Routing and scheduling in a flexible job shop by tabu search","volume":"41","author":"Brandimarte","year":"1993","journal-title":"Annals of Operations Research"},{"issue":"4","key":"10.1016\/j.cor.2013.06.010_bib9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01719451","article-title":"Tabu search for the job-shop scheduling problem with multi-purpose machines","volume":"15","author":"Hurink","year":"1994","journal-title":"OR Spectrum"},{"issue":"0","key":"10.1016\/j.cor.2013.06.010_bib10","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018930406487","article-title":"An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search","volume":"70","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"1997","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/j.cor.2013.06.010_bib11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","article-title":"Effective neighbourhood functions for the flexible job shop problem","volume":"3","author":"Mastrolilli","year":"2000","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.cor.2013.06.010_bib12","doi-asserted-by":"crossref","unstructured":"Bozejko W, Uchronski M, Wodecki M. Parallel Meta2heuristics for the Flexible Job Shop Problem. In: Proceedings of ICAISC 2010, Part II, Lecture notes in computer science, vol. 6114, p. 395\u2013402.","DOI":"10.1007\/978-3-642-13232-2_48"},{"issue":"10","key":"10.1016\/j.cor.2013.06.010_bib13","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","article-title":"A genetic algorithm for the flexible job-shop scheduling problem","volume":"35","author":"Pezzella","year":"2008","journal-title":"Computers & Operations Research"},{"issue":"9","key":"10.1016\/j.cor.2013.06.010_bib14","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","article-title":"A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems","volume":"35","author":"Gao","year":"2008","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.cor.2013.06.010_bib15","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","article-title":"An artificial immune algorithm for the flexible job-shop scheduling problem","volume":"26","author":"Bagheri","year":"2010","journal-title":"Future Generation Computer Systems"},{"issue":"3","key":"10.1016\/j.cor.2013.06.010_bib16","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1016\/j.asoc.2009.10.006","article-title":"A knowledge-based ant colony optimization for flexible job shop scheduling problems","volume":"10","author":"Xing","year":"2010","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.cor.2013.06.010_bib17","doi-asserted-by":"crossref","unstructured":"Wang L, Zhou G, Xu Y, Wang S, Liu M. An effective artificial bee colony algorithm for the flexible job-shop scheduling problem. International Journal of Advanced Manufacturing Technology 2012; 60(1-4):303\u201315.","DOI":"10.1007\/s00170-011-3610-1"},{"key":"10.1016\/j.cor.2013.06.010_bib18","unstructured":"Moscato P. On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. C3P Report 826, California Institute of Technology; 1989."},{"key":"10.1016\/j.cor.2013.06.010_bib19","unstructured":"Harvey WD. Nonsystematic backtracking search. Ph.D. thesis, CIRL, University of Oregon; 1995."},{"key":"10.1016\/j.cor.2013.06.010_bib20","doi-asserted-by":"crossref","unstructured":"Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. In: CP-98, Fourth international conference on principles and practice of constraint programming, Lecture notes in computer science, vol. 1520; 1998. p. 417\u201331.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"10.1016\/j.cor.2013.06.010_bib21","unstructured":"Cesta A, Oddi A, Smith S. Iterative flattening: a scalable method for solving multi-capacity scheduling problems. In: Proceedings of the national conference on artificial intelligence, 2000. p. 742\u20137."},{"issue":"12","key":"10.1016\/j.cor.2013.06.010_bib22","doi-asserted-by":"crossref","first-page":"2192","DOI":"10.1016\/j.cor.2010.03.009","article-title":"Discrepancy search for the flexible job shop scheduling problem","volume":"37","author":"Ben Hmida","year":"2010","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cor.2013.06.010_bib23","unstructured":"Pacino D, Van Hentenryck P. Large neighborhood search and adaptive randomized decompositions for flexible jobshop scheduling. In: Proceedings of the 22th international joint conference on artificial intelligence, Barcelona, 2011."},{"key":"10.1016\/j.cor.2013.06.010_bib24","unstructured":"Oddi A, Rasconi R, Cesta A, Smith S. Iterative flattening search for the flexible job shop scheduling problem. In: Proceedings of the 22th international joint conference on artificial intelligence, Barcelona, 2011."},{"issue":"2","key":"10.1016\/j.cor.2013.06.010_bib25","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","article-title":"A new heuristic optimization algorithm","volume":"76","author":"Geem","year":"2001","journal-title":"Simulation"},{"issue":"8","key":"10.1016\/j.cor.2013.06.010_bib26","doi-asserted-by":"crossref","first-page":"5270","DOI":"10.1016\/j.asoc.2011.05.033","article-title":"A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers","volume":"11","author":"Pan","year":"2011","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.cor.2013.06.010_bib27","doi-asserted-by":"crossref","first-page":"3902","DOI":"10.1016\/j.cma.2004.09.007","article-title":"A new meta-heuristic algorithm for continuous engineering optimization","volume":"194","author":"Lee","year":"2005","journal-title":"Computer Methods in Applied Mechanics and Engineering"},{"key":"10.1016\/j.cor.2013.06.010_bib28","first-page":"573","article-title":"A paralleled genetic algorithm based on a neighborhood model and its application to the jobshop scheduling","volume":"2","author":"Tamaki","year":"1992","journal-title":"Parallel Problem Solving from Nature"},{"issue":"4","key":"10.1016\/j.cor.2013.06.010_bib29","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/0360-8352(96)00047-2","article-title":"A tutorial survey of job-shop scheduling problems using genetic algorithms\u2014I. Representation","volume":"30","author":"Cheng","year":"1996","journal-title":"Computers & Industrial Engineering"},{"issue":"12","key":"10.1016\/j.cor.2013.06.010_bib30","doi-asserted-by":"crossref","first-page":"7929","DOI":"10.1016\/j.eswa.2010.04.042","article-title":"Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms","volume":"37","author":"Wang","year":"2010","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"10.1016\/j.cor.2013.06.010_bib31","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10852-008-9100-2","article-title":"Principles for the design of large neighborhood search","volume":"8","author":"Carchrae","year":"2009","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"10.1016\/j.cor.2013.06.010_bib32","doi-asserted-by":"crossref","unstructured":"Michel L, Van Hentenryck P. A constraint-based architecture for local search. In: Conference on object-oriented programming systems, languages, and applications, Seattle, November 2002. p. 101\u201310.","DOI":"10.1145\/582419.582430"},{"key":"10.1016\/j.cor.2013.06.010_bib33","unstructured":"Comet Tutorial. URL: \u3008https:\/\/2.zoppoz.workers.dev:443\/http\/www.lsi.upc.edu\/~larrosa\/comet.pdf\u3009; 2010."},{"key":"10.1016\/j.cor.2013.06.010_bib34","unstructured":"Godard D, Laborie P, Nuijten W. Randomized large neighborhood search for cumulative scheduling. In: Proceedings of the 15th international conference on automated planning & scheduling, 2005. p. 81\u20139."},{"key":"10.1016\/j.cor.2013.06.010_bib35","unstructured":"Barnes JW, Chambers JB. Flexible Job Shop Scheduling by tabu search. Graduate program in operations research and industrial engineering. The University of Texas at Austin, Technical Report Series, ORP96-09; 1996."},{"key":"10.1016\/j.cor.2013.06.010_bib36","doi-asserted-by":"crossref","unstructured":"Mastrolilli M, Gambardella L. Effective neighbourhood functions for the flexible job shop problem: Appendix, Technical Report, IDSIA-Istituto Dalle Intelligenza Artificiale. Electronic version available at: \u3008https:\/\/2.zoppoz.workers.dev:443\/http\/www.idsia.ch\/~monaldo\/fjsp.html\u3009; 2000.","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y"},{"key":"10.1016\/j.cor.2013.06.010_bib37","unstructured":"Dongarra J. Performance of various computers using standard linear equations software. Computer Science Department, University of Tennessee, Knoxville, Tennessee; 2009."},{"key":"10.1016\/j.cor.2013.06.010_bib38","doi-asserted-by":"crossref","unstructured":"Jain S, Van Hentenryck P. Large neighborhood search for dial-a-ride problems. In: CP-2011, 17th international conference on principles and practice of constraint programming, Lecture notes in computer science, vol. 6876; 2011. p. 400\u201313.","DOI":"10.1007\/978-3-642-23786-7_31"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0305054813001676?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0305054813001676?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T21:02:11Z","timestamp":1596056531000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054813001676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":38,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["S0305054813001676"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.cor.2013.06.010","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2013,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An integrated search heuristic for large-scale flexible job shop scheduling problems","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.cor.2013.06.010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}