{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T18:40:40Z","timestamp":1777574440076,"version":"3.51.4"},"reference-count":22,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"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":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0360-8352(03)00077-9","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T00:00:46Z","timestamp":1063324846000},"page":"597-613","source":"Crossref","is-referenced-by-count":185,"title":["A hybrid genetic algorithm for the job shop scheduling problems"],"prefix":"10.1016","volume":"45","author":[{"given":"Byung Joo","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyung Rim","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyun Soo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0360-8352(03)00077-9_BIB1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","article-title":"The shifting bottleneck procedure in job shop scheduling","volume":"34","author":"Adams","year":"1988","journal-title":"Management Science"},{"issue":"2","key":"10.1016\/S0360-8352(03)00077-9_BIB2","first-page":"149","article-title":"A computational study of the job shop scheduling problem, ORSA","volume":"3","author":"Applegate","year":"1991","journal-title":"Journal on Computing"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB3","series-title":"Exploring problem-specific recombination operators for job shop scheduling","author":"Bagchi","year":"1991"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB4","series-title":"A generalized permutation approach to job shop scheduling with genetic algorithms, OR-Spektrum","first-page":"87","author":"Bierwirth","year":"1995"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB5","series-title":"On permutation representations for scheduling problems","first-page":"310","author":"Bierwirth","year":"1996"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB6","series-title":"Probl\u00e8mes d'ordonnancement, col. ERI","author":"Carlier","year":"1988"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB7","unstructured":"Chambers, J.B (1996). Classical and flexible job shop scheduling by tabu search. PhD thesis. Department of Computer Science, University of Texas."},{"key":"10.1016\/S0360-8352(03)00077-9_BIB8","unstructured":"Cheng, R (1997). A study on genetic algorithms-based optimal scheduling techniques. PhD thesis. Tokyo Institute of Technology."},{"issue":"1","key":"10.1016\/S0360-8352(03)00077-9_BIB9","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0305-0548(93)E0015-L","article-title":"A genetic algorithm for the job shop problem","volume":"22","author":"Croce","year":"1995","journal-title":"Computer and Operations Research"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB10","series-title":"Job shop scheduling with genetic algorithms","author":"Davis","year":"1985"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB11","series-title":"Combining genetic and local search for solving the job shop scheduling problem","author":"Dorndorf","year":"1993"},{"issue":"1","key":"10.1016\/S0360-8352(03)00077-9_BIB12","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0305-0548(93)E0016-M","article-title":"Evolution based learning in a job shop scheduling environment","volume":"22","author":"Dorndorf","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB13","series-title":"A promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems","author":"Fang","year":"1993"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB14","series-title":"Genetic algorithms and engineering design","author":"Gen","year":"1997"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB15","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\/S0360-8352(03)00077-9_BIB16","series-title":"Foundations of genetic algorithms","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-08-050684-5.50008-2","article-title":"A comparative analysis of selection schemes used in genetic algorithms","author":"Goldberg","year":"1991"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB17","series-title":"Industrial scheduling","author":"Muth","year":"1963"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB18","series-title":"Conventional genetic algorithms for job shop problems","author":"Nakano","year":"1991"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB19","series-title":"Handbook of genetic algorithms","first-page":"332","article-title":"Schedule optimization using genetic algorithms","author":"Syswerda","year":"1991"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB20","series-title":"A parallel genetic algorithm based on a neighborhood model and it's application to the job shop scheduling","volume":"vol. 2","author":"Tamaki","year":"1992"},{"issue":"5","key":"10.1016\/S0360-8352(03)00077-9_BIB21","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/64.236477","article-title":"Managing genetic search in job shop scheduling","volume":"8","author":"Uckun","year":"1993","journal-title":"IEEE Expert"},{"key":"10.1016\/S0360-8352(03)00077-9_BIB22","series-title":"A genetic algorithm applicable to large-scale job shop problems","volume":"vol. 2","author":"Yamada","year":"1992"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835203000779?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835203000779?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:54:25Z","timestamp":1551070465000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835203000779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0360835203000779"],"URL":"https:\/\/doi.org\/10.1016\/s0360-8352(03)00077-9","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}