{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T05:31:29Z","timestamp":1781674289159,"version":"3.54.5"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0377-2217(02)00645-8","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T20:45:15Z","timestamp":1043959515000},"page":"215-225","source":"Crossref","is-referenced-by-count":63,"title":["The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure"],"prefix":"10.1016","volume":"152","author":[{"given":"P.","family":"Pongcharoen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.","family":"Hicks","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P.M.","family":"Braiden","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00645-8_BIB1","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/S0377-2217(02)00645-8_BIB2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0377-2217(97)00136-7","article-title":"A tabu search approach for the flow shop scheduling problem","volume":"109","author":"Ben-Daya","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00645-8_BIB3","series-title":"Scheduling Computer and Manufacturing Processes","author":"Blazewicz","year":"1996"},{"issue":"1","key":"10.1016\/S0377-2217(02)00645-8_BIB4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0305-0548(93)E0015-L","article-title":"A genetic algorithms for the job shop problem","volume":"22","author":"Croce","year":"1995","journal-title":"Computers Operations Research"},{"key":"10.1016\/S0377-2217(02)00645-8_BIB5","series-title":"Genetic Algorithms and Engineering Design","author":"Gen","year":"1997"},{"key":"10.1016\/S0377-2217(02)00645-8_BIB6","series-title":"Genetic Algorithms in Search, Optimisation and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/S0377-2217(02)00645-8_BIB7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/opre.16.2.353","article-title":"A branch-bound solution to the general scheduling problem","volume":"16","author":"Greenberg","year":"1968","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00645-8_BIB8","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","article-title":"A dynamic programming approach to sequencing problems","volume":"10","author":"Held","year":"1962","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00645-8_BIB9","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","article-title":"Deterministic job shop scheduling: Part, present and future","volume":"113","author":"Jain","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00645-8_BIB10","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0377-2217(97)00420-7","article-title":"Some new results on simulated annealing applied to the job shop scheduling problem","volume":"113","author":"Kolonko","year":"1999","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/S0377-2217(02)00645-8_BIB11","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1080\/002075497195605","article-title":"Job shop scheduling with a genetic algorithm and machine learning","volume":"35","author":"Lee","year":"1997","journal-title":"International Journal of production research"},{"key":"10.1016\/S0377-2217(02)00645-8_BIB12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/opre.8.2.219","article-title":"On the job shop scheduling problem","volume":"8","author":"Manne","year":"1960","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00645-8_BIB13","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0377-2217(93)E0140-S","article-title":"Multiple and bicriteria scheduling: A literature survey","volume":"81","author":"Nagar","year":"1995","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/S0377-2217(02)00645-8_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":"Management Science"},{"key":"10.1016\/S0377-2217(02)00645-8_BIB15","series-title":"Tcl and the Tk toolkit","author":"Ousterhout","year":"1994"},{"issue":"9","key":"10.1016\/S0377-2217(02)00645-8_BIB16","doi-asserted-by":"crossref","first-page":"2051","DOI":"10.1080\/002075400188492","article-title":"Dispatching rules for scheduling in assembly job shops\u2013Part I","volume":"38","author":"Reeja","year":"2000","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(02)00645-8_BIB17","unstructured":"Todd, D., 1997. Multiple criteria genetic algorithms in engineering design and operation, Ph.D. thesis, Faculty of Engineering, University of Newcastle upon Tyne, UK"},{"issue":"2","key":"10.1016\/S0377-2217(02)00645-8_BIB18","first-page":"133","article-title":"Improved genetic algorithms for job shop scheduling problems","volume":"3","author":"Tsujimura","year":"1997","journal-title":"Engineering Design and Automation"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702006458?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702006458?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T03:59:00Z","timestamp":1553918340000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702006458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0377221702006458"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00645-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}