{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T13:17:09Z","timestamp":1772025429318,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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 & Operations Research"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1016\/0305-0548(93)e0015-l","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"15-24","source":"Crossref","is-referenced-by-count":285,"title":["A genetic algorithm for the job shop problem"],"prefix":"10.1016","volume":"22","author":[{"given":"Federico","family":"Della Croce","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Tadei","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Volta","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(93)E0015-L_BIB1","series-title":"Report BS-R8909","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1989"},{"key":"10.1016\/0305-0548(93)E0015-L_BIB2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and job-shop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Math. Opl Res."},{"key":"10.1016\/0305-0548(93)E0015-L_BIB3","series-title":"Industrial Scheduling","author":"Muth","year":"1963"},{"key":"10.1016\/0305-0548(93)E0015-L_BIB4","series-title":"Proceedings of the Fourth International Conference on Genetic Algorithms and Their Application","article-title":"Conventional genetic algorithm for job shop scheduling","author":"Nakano","year":"1991"},{"key":"10.1016\/0305-0548(93)E0015-L_BIB5","series-title":"Proceedings of the 1991 IEEE International Conference on Robotics and Automation","article-title":"A genetic algorithm for job shop","author":"Falkenauer","year":"1991"},{"key":"10.1016\/0305-0548(93)E0015-L_BIB6","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":"Opns Res."},{"key":"10.1016\/0305-0548(93)E0015-L_BIB7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","article-title":"Applying tabu search to the job shop scheduling problem","volume":"41","author":"Dell'Amico","year":"1993","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(93)E0015-L_BIB8","series-title":"Adaption in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/0305-0548(93)E0015-L_BIB9","series-title":"Report No. 89-058","article-title":"Genetic Algorithms: the state-of-the-art and some research proposals","author":"Dorigo","year":"1989"},{"key":"10.1016\/0305-0548(93)E0015-L_BIB10","article-title":"An analysis of the behaviour of a class of genetic adaptive systems","author":"De Jong","year":"1975"},{"key":"10.1016\/0305-0548(93)E0015-L_BIB11","author":"Davis","year":"1991"},{"key":"10.1016\/0305-0548(93)E0015-L_BIB12","series-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/0305-0548(93)E0015-L_BIB13","series-title":"Proceedings of an International Conference on Genetic Algorithms and Their Application","article-title":"Alleles, loci and the traveling salesman problem","author":"Goldberg","year":"1985"},{"key":"10.1016\/0305-0548(93)E0015-L_BIB14","series-title":"Sequencing and Scheduling","author":"French","year":"1982"},{"key":"10.1016\/0305-0548(93)E0015-L_BIB15","series-title":"Proceedings of the Third International Conference on Genetic Algorithms and Their Applications","article-title":"Uniform Crossover in genetic algorithms","author":"Syswerda","year":"1989"},{"key":"10.1016\/0305-0548(93)E0015-L_BIB16","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":"Mgmt Sci."},{"key":"10.1016\/0305-0548(93)E0015-L_BIB17","series-title":"Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques","author":"Lawrence","year":"1984"},{"key":"10.1016\/0305-0548(93)E0015-L_BIB18","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."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054893E0015L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054893E0015L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T23:56:59Z","timestamp":1556150219000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054893E0015L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["0305054893E0015L"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(93)e0015-l","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}