{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T21:13:57Z","timestamp":1771017237353,"version":"3.50.1"},"reference-count":39,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0167-8191(03)00014-0","type":"journal-article","created":{"date-parts":[[2003,3,26]],"date-time":"2003-03-26T00:16:29Z","timestamp":1048637789000},"page":"393-430","source":"Crossref","is-referenced-by-count":157,"title":["Parallel GRASP with path-relinking for job shop scheduling"],"prefix":"10.1016","volume":"29","author":[{"given":"R.M.","family":"Aiex","sequence":"first","affiliation":[]},{"given":"S.","family":"Binato","sequence":"additional","affiliation":[]},{"given":"M.G.C.","family":"Resende","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(03)00014-0_BIB1","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 Journal on Computing"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","article-title":"Computational complexity of discrete optimization problems","volume":"4","author":"Lenstra","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0167-8191(03)00014-0_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 Journal on Computing"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0166-218X(94)90204-6","article-title":"A branch and bound algorithm for the job-shop scheduling problem","volume":"49","author":"Brucker","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB5","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","article-title":"A practical use of Jackson\u2019s preemptive schedule for solving the job-shop problem","volume":"26","author":"Carlier","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB7","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.8.4.487","article-title":"Algorithms for solving production scheduling problems","volume":"8","author":"Giffler","year":"1960","journal-title":"Operations Research"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB8","series-title":"Industrial Scheduling","first-page":"225","article-title":"Probabilistic learning combinations of local job-shop scheduling rules","author":"Fisher","year":"1963"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB9","series-title":"Scheduling Theory and Its Application","first-page":"277","article-title":"The job shop scheduling problem: a concise survey and some recent developments","author":"Pinson","year":"1995"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB10","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 Journal on Computing"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB11","series-title":"Sequencing and Scheduling: An Introduction to the Mathematics of the Job-shop","author":"French","year":"1982"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB12","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":"Management Science"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB13","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0377-2217(95)00012-F","article-title":"Local optimization and the job-shop scheduling problem","volume":"83","author":"Louren\u00e7o","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB14","series-title":"Meta-Heuristics: Theory and Apllications","first-page":"219","article-title":"Combining the large-step optimization with tabu-search: application to the job-shop scheduling problem","author":"Louren\u00e7o","year":"1996"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB15","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":"Operations Research"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB16","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 Science"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB17","series-title":"Proceedings of the First International Conference on Genetic Algorithms and their Applications","first-page":"136","article-title":"Job shop scheduling with genetic algorithms","author":"Davis","year":"1985"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB18","series-title":"Essays and Surveys on Metaheuristics","first-page":"59","article-title":"A GRASP for job shop scheduling","author":"Binato","year":"2001"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB19","unstructured":"A.S. Jain, S. Meeran, A state-of-the-art review of job-shop scheduling techniques, Technical Report, Department of Applied Physics, Electronic and Mechanical Engineering, University of Dundee, Dundee, Scotland, 1998"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB20","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","article-title":"A probabilistic heuristic for a computationally difficult set covering problem","volume":"8","author":"Feo","year":"1989","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptive search procedures","volume":"6","author":"Feo","year":"1995","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB22","series-title":"Essays and Surveys on Metaheuristics","first-page":"325","article-title":"GRASP: an annotated bibliography","author":"Festa","year":"2001"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB23","series-title":"Handbook of Metaheuristics","first-page":"219","article-title":"Greedy randomized adaptive search procedures","author":"Resende","year":"2002"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB24","series-title":"Les probl\u00e8mes d\u2019ordonnancement avec contraintes disjonctives","author":"Roy","year":"1964"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB25","series-title":"Interfaces in Computer Science and Operations Research","first-page":"1","article-title":"Tabu search and adaptive memory programing\u2013\u2013advances, applications and challenges","author":"Glover","year":"1996"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB26","series-title":"Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research","first-page":"1","article-title":"Multi-start and strategic oscillation methods\u2013\u2013principles to exploit adaptive memory","author":"Glover","year":"2000"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB27","series-title":"Tabu Search","author":"Glover","year":"1997"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB28","first-page":"653","article-title":"Fundamentals of scatter search and path relinking","volume":"39","author":"Glover","year":"2000","journal-title":"Control and Cybernetics"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB29","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","article-title":"GRASP and path relinking for 2-layer straight line crossing minimization","volume":"11","author":"Laguna","year":"1999","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB30","unstructured":"R. Aiex, M. Resende, P. Pardalos, G. Toraldo, GRASP with path-relinking for the three-index assignment problem, Technical Report, AT&T Labs-Research, 2000"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB31","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.1023","article-title":"Local search with perturbations for the prize-collecting Steiner tree problem in graphs","volume":"38","author":"Canuto","year":"2001","journal-title":"Networks"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB32","unstructured":"M. Resende, C. Ribeiro, A grasp with path-relinking for permanent virtual circuit routing, Technical Report, AT&T Labs Research, 2001"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB33","unstructured":"C. Ribeiro, E. Uchoa, R. Werneck, A hybrid GRASP with perturbations for the Steiner problem in graphs, Technical Report, Computer Science Department, Catholic University of Rio de Janeiro, 2001"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB34","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","article-title":"Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory","volume":"11","author":"Fleurent","year":"1999","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB35","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02430365","article-title":"Parallel local search","volume":"1","author":"Verhoeven","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB36","article-title":"The MPI Core","volume":"vol. 1","author":"Snir","year":"1998"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB37","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":"Journal of the Operational Research Society"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB38","unstructured":"R. Aiex, M. Resende, C. Ribeiro, Probability distribution of solution time in GRASP: an experimental investigation, Technical Report, AT&T Labs Research, Florham Park, NJ 07733, 2000"},{"key":"10.1016\/S0167-8191(03)00014-0_BIB39","series-title":"Graphical Methods for Data Analysis","author":"Chambers","year":"1983"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000140?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000140?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T07:31:01Z","timestamp":1584516661000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819103000140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0167819103000140"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(03)00014-0","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}