{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:55:50Z","timestamp":1772297750827,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61100144"],"award-info":[{"award-number":["61100144"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61370183"],"award-info":[{"award-number":["61370183"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"New Century Excellent Talents in University"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1016\/j.cor.2014.08.006","type":"journal-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T07:31:29Z","timestamp":1408433489000},"page":"154-164","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":144,"special_numbering":"C","title":["A tabu search\/path relinking algorithm to solve the job shop scheduling problem"],"prefix":"10.1016","volume":"53","author":[{"given":"Bo","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.C.E.","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.cor.2014.08.006_bib1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","article-title":"The shifting bottleneck procedure for job shop scheduling","volume":"34","author":"Adams","year":"1988","journal-title":"Manag Sci"},{"issue":"4","key":"10.1016\/j.cor.2014.08.006_bib2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","article-title":"Parallel GRASP with path-relinking for job shop scheduling","volume":"29","author":"Aiex","year":"2003","journal-title":"Parallel Comput"},{"issue":"2","key":"10.1016\/j.cor.2014.08.006_bib3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","article-title":"A computational study of the job-shop scheduling problem","volume":"3","author":"Applegate","year":"1991","journal-title":"ORSA J Comput"},{"issue":"2","key":"10.1016\/j.cor.2014.08.006_bib4","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":"Manag Sci"},{"issue":"1","key":"10.1016\/j.cor.2014.08.006_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 J Comput"},{"key":"10.1016\/j.cor.2014.08.006_bib6","first-page":"1","article-title":"A hybrid evolutionary algorithm to solve the job shop scheduling problem","author":"Cheng","year":"2013","journal-title":"Ann Oper Res"},{"key":"10.1016\/j.cor.2014.08.006_bib7","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1009627429878","article-title":"A computational study of shifting bottleneck procedures for shop scheduling problems","volume":"3","author":"Demirkol","year":"1997","journal-title":"J Heuristics"},{"key":"10.1016\/j.cor.2014.08.006_bib8","first-page":"225","article-title":"Probabilistic learning combinations of local job-shop scheduling rules","author":"Fisher","year":"1963","journal-title":"Ind Sched"},{"issue":"2","key":"10.1016\/j.cor.2014.08.006_bib9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1111\/itor.12044","article-title":"An extended akers graphical method with a biased random-key genetic algorithm for job-shop scheduling","volume":"21","author":"Gon\u00e7alves","year":"2014","journal-title":"Int Trans Oper Res"},{"key":"10.1016\/j.cor.2014.08.006_bib10","unstructured":"Lawrence S. Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Technical report. Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburg; 1984."},{"key":"10.1016\/j.cor.2014.08.006_bib11","first-page":"168","article-title":"Guided ejection search for the job shop scheduling problem","author":"Nagata","year":"2009","journal-title":"Evol Comput Comb Optim"},{"issue":"4","key":"10.1016\/j.cor.2014.08.006_bib12","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1016\/j.cie.2011.12.018","article-title":"A GES\/TS algorithm for the job shop scheduling","volume":"62","author":"Nasiri","year":"2012","journal-title":"Comput Ind Eng"},{"issue":"9\u201312","key":"10.1016\/j.cor.2014.08.006_bib13","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1007\/s00170-011-3441-0","article-title":"A guided tabu search\/path relinking algorithm for the job shop problem","volume":"58","author":"Nasiri","year":"2012","journal-title":"Int J Adv Manuf Technol"},{"issue":"6","key":"10.1016\/j.cor.2014.08.006_bib14","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":"Manag Sci"},{"key":"10.1016\/j.cor.2014.08.006_bib15","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":"J Sched"},{"key":"10.1016\/j.cor.2014.08.006_bib16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10287-006-0023-y","article-title":"An algorithm for the job shop scheduling problem based on global equilibrium search techniques","volume":"3","author":"Pardalos","year":"2006","journal-title":"Comput Manag Sci"},{"key":"10.1016\/j.cor.2014.08.006_bib17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10589-008-9206-5","article-title":"Solving job shop scheduling problems utilizing the properties of backbone and big valley","volume":"47","author":"Pardalos","year":"2010","journal-title":"Comput Optim Appl"},{"issue":"10","key":"10.1016\/j.cor.2014.08.006_bib18","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":"Comput Oper Res"},{"issue":"1","key":"10.1016\/j.cor.2014.08.006_bib19","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.ejor.2012.03.001","article-title":"Solving the serial batching problem in job shop manufacturing systems","volume":"221","author":"Shen","year":"2012","journal-title":"Eur J Oper Res"},{"issue":"10","key":"10.1016\/j.cor.2014.08.006_bib20","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":"Manag Sci"},{"issue":"2","key":"10.1016\/j.cor.2014.08.006_bib21","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"},{"key":"10.1016\/j.cor.2014.08.006_bib22","unstructured":"Yamada T, Nakano R. A genetic algorithm applicable to large-scale job-shop problems. In: PPSN; 1992. p. 283\u201392."},{"issue":"11","key":"10.1016\/j.cor.2014.08.006_bib23","doi-asserted-by":"crossref","first-page":"3229","DOI":"10.1016\/j.cor.2005.12.002","article-title":"A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem","volume":"34","author":"Zhang","year":"2007","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1016\/j.cor.2014.08.006_bib24","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","article-title":"A very fast TS\/SA algorithm for the job shop scheduling problem","volume":"35","author":"Zhang","year":"2008","journal-title":"Comput Oper Res"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0305054814002160?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:S0305054814002160?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,9,30]],"date-time":"2018-09-30T12:55:39Z","timestamp":1538312139000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054814002160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":24,"alternative-id":["S0305054814002160"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.cor.2014.08.006","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2015,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A tabu search\/path relinking algorithm to solve the job shop scheduling problem","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.2014.08.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}