{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T08:02:44Z","timestamp":1768550564812,"version":"3.49.0"},"reference-count":36,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3855,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0004-3702(02)00363-6","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T13:11:25Z","timestamp":1043932285000},"page":"189-217","source":"Crossref","is-referenced-by-count":74,"title":["Problem difficulty for tabu search in job-shop scheduling"],"prefix":"10.1016","volume":"143","author":[{"given":"Jean-Paul","family":"Watson","sequence":"first","affiliation":[]},{"given":"J.Christopher","family":"Beck","sequence":"additional","affiliation":[]},{"given":"Adele E.","family":"Howe","sequence":"additional","affiliation":[]},{"given":"L.Darrell","family":"Whitley","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(02)00363-6_BIB001","series-title":"Proc. AAAI-2000, Austin, TX","first-page":"256","article-title":"Generating satisfiable problem instances","author":"Achlioptas","year":"2000"},{"issue":"2","key":"10.1016\/S0004-3702(02)00363-6_BIB002","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","article-title":"Guided local search with shifting bottleneck for job-shop scheduling","volume":"44","author":"Balas","year":"1998","journal-title":"Management Sci."},{"key":"10.1016\/S0004-3702(02)00363-6_BIB003","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/07408179508936739","article-title":"Solving the job shop scheduling problem with tabu search","volume":"27","author":"Barnes","year":"1995","journal-title":"IIE Trans."},{"issue":"11","key":"10.1016\/S0004-3702(02)00363-6_BIB004","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-library: Distributing test problems by electronic mail","volume":"41","author":"Beasley","year":"1990","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"10.1016\/S0004-3702(02)00363-6_BIB005","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0004-3702(99)00099-5","article-title":"Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics","volume":"117","author":"Beck","year":"2000","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB006","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","article-title":"The job shop scheduling problem: Conventional and new solution techniques","volume":"93","author":"Bla\u017cewicz","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0004-3702(02)00363-6_BIB007","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0377-2217(99)00486-5","article-title":"The disjunctive graph machine representation of the job shop scheduling problem","volume":"127","author":"Bla\u017cewicz","year":"2000","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0004-3702(02)00363-6_BIB008","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","article-title":"A new adaptive multi-start technique for combinatorial optimization","volume":"16","author":"Boese","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0004-3702(02)00363-6_BIB009","unstructured":"J.B. Chambers, J.W. Barnes, New tabu search results for the job shop scheduling problem, Technical Report ORP96-10, Graduate Program in Operations Research and Industrial Engineering, The University of Texas at Austin, 1996"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB010","series-title":"Proceedings of the Second International Conference on Principles and Practices of Constraint Programming (CP-96), Cambridge, MA","first-page":"119","article-title":"Local search and the number of solutions","author":"Clark","year":"1996"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB011","series-title":"Empirical Methods for Artificial Intelligence","author":"Cohen","year":"1995"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB012","series-title":"Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules","author":"Fisher","year":"1963"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB013","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1613\/jair.445","article-title":"When gravity fails: Local search topology","volume":"7","author":"Frank","year":"1997","journal-title":"J. Artificial Intelligence Res."},{"issue":"2","key":"10.1016\/S0004-3702(02)00363-6_BIB014","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":"Math. Oper. Res."},{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00363-6_BIB015","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0004-3702(94)90109-0","article-title":"Easy problems are sometimes hard","volume":"70","author":"Gent","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB016","series-title":"Tabu Search","author":"Glover","year":"1997"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00363-6_BIB017","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(95)00044-5","article-title":"Phase transitions and the search problem","volume":"81","author":"Hogg","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB018","unstructured":"H.H. Hoos, Stochastic local search\u2014Methods, models, applications, PhD Thesis, Darmstadt University of Technology, 1998"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB019","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","article-title":"Deterministic job-shop scheduling: Past, present and future","volume":"113","author":"Jain","year":"1999","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0004-3702(02)00363-6_BIB020","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1023\/A:1018979424002","article-title":"A search space analysis of the job shop scheduling problem","volume":"86","author":"Mattfeld","year":"1999","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0004-3702(02)00363-6_BIB021","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1038\/22055","article-title":"Determining computational complexity for characteristic \u2018phase transitions\u2019","volume":"400","author":"Monasson","year":"1998","journal-title":"Nature"},{"issue":"6","key":"10.1016\/S0004-3702(02)00363-6_BIB022","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast taboo search algorithm for the job shop problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Management Sci."},{"key":"10.1016\/S0004-3702(02)00363-6_BIB023","series-title":"An Introduction to Statistical Methods and Data Analysis","author":"Lyman Ott","year":"1993"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB024","series-title":"Proc. AAAI-97, Providence, RI","first-page":"340","article-title":"Clustering at the phase transition","author":"Parkes","year":"1997"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB025","unstructured":"C.M. Riedys, P.F. Stadler, Combinatorial landscapes, Technical Report 01-03-014, The Santa Fe Institute, 2001"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB026","unstructured":"J. Singer, Why solutions can be hard to find: A featural theory of cost for a local search algorithm on random satisfiability, PhD Thesis, University of Edinburgh, 2000"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB027","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1613\/jair.711","article-title":"Backbone fragility and the local search cost peak","volume":"12","author":"Singer","year":"2000","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(02)00363-6_BIB028","series-title":"Proc. IJCAI-01, Seattle, WA","first-page":"254","article-title":"Backbones in optimization and approximation","author":"Slaney","year":"2001"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB029","series-title":"Proc. IJCAI-95, Montreal, Quebec","article-title":"Sparse constraint graphs and exceptionally hard problems","author":"Smith","year":"1995"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB030","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","article-title":"New search spaces for sequencing problems with application to job shop scheduling","volume":"38","author":"Storer","year":"1992","journal-title":"Management Sci."},{"key":"10.1016\/S0004-3702(02)00363-6_BIB031","unstructured":"T. St\u00fctzle, Local search algorithms for combinatorial problems\u2014Analysis, improvements, and new applications, PhD Thesis, Darmstadt University of Technology, 1999"},{"key":"10.1016\/S0004-3702(02)00363-6_BIB032","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 J. Oper. Res."},{"issue":"2","key":"10.1016\/S0004-3702(02)00363-6_BIB033","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","article-title":"Parallel taboo search techniques for the job shop scheduling problem","volume":"6","author":"Taillard","year":"1994","journal-title":"ORSA J. Comput."},{"issue":"3","key":"10.1016\/S0004-3702(02)00363-6_BIB034","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/ijoc.8.3.302","article-title":"Job shop scheduling by local search","volume":"8","author":"Vaessens","year":"1996","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/S0004-3702(02)00363-6_BIB035","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job shop scheduling by simulated annealing","volume":"40","author":"van Laarhoven","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/S0004-3702(02)00363-6_BIB036","series-title":"Proceedings of the Sixth European Conference on Planning","article-title":"Toward an understanding of local search cost in job-shop scheduling","author":"Watson","year":"2001"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202003636?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202003636?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T20:51:50Z","timestamp":1583959910000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370202003636"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0004370202003636"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(02)00363-6","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}