{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T21:58:12Z","timestamp":1769810292819,"version":"3.49.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"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":["Artificial Intelligence in Engineering"],"published-print":{"date-parts":[[1999,10]]},"DOI":"10.1016\/s0954-1810(99)00021-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:24:09Z","timestamp":1027657449000},"page":"399-403","source":"Crossref","is-referenced-by-count":77,"title":["A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines"],"prefix":"10.1016","volume":"13","author":[{"given":"Liu","family":"Min","sequence":"first","affiliation":[]},{"given":"Wu","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0954-1810(99)00021-7_BIB1","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1287\/moor.2.4.320","article-title":"On the complexity of mean flow time scheduling","volume":"2","author":"Sethi","year":"1977","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0954-1810(99)00021-7_BIB2","series-title":"Computer and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"issue":"2","key":"10.1016\/S0954-1810(99)00021-7_BIB3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(85)90009-5","article-title":"Analysis of a linear programming heuristic for scheduling unrelated parallel machines","volume":"10","author":"Potts","year":"1983","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0954-1810(99)00021-7_BIB4","doi-asserted-by":"crossref","unstructured":"Bernstein D, Pinter RY, Rodeh M. Optimal scheduling of arithmetic operations in parallel with memory, The Annual ACM Symposium on Principles of Programming Languages, New York, 1985.","DOI":"10.1145\/318593.318662"},{"key":"10.1016\/S0954-1810(99)00021-7_BIB5","doi-asserted-by":"crossref","unstructured":"Luh PB, Hoitomt DJ, Max E. Parallel machine scheduling using Lagrangian relaxation. IEEE International Conference on Computer Integrated Manufacturing, New York, 1988. pp. 244\u2013248.","DOI":"10.1109\/CIM.1988.5415"},{"key":"10.1016\/S0954-1810(99)00021-7_BIB6","doi-asserted-by":"crossref","unstructured":"Narahari Y, Srigopal R. Real-world extensions to scheduling algorithms based on Lagrangian relaxation. Proceedings in Engineering Sciences 21st, 1996. pp. 415\u2013433.","DOI":"10.1007\/BF02745567"},{"issue":"3","key":"10.1016\/S0954-1810(99)00021-7_BIB7","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","article-title":"State-of-the-art review of parallel-machine scheduling research","volume":"47","author":"Cheng","year":"1990","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/S0954-1810(99)00021-7_BIB8","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0377-2217(91)90304-E","article-title":"Mathematical programming formulations for machine scheduling, a survey","volume":"51","author":"Blazewicz","year":"1991","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0954-1810(99)00021-7_BIB9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207548208947745","article-title":"The state-of-art survey of dispatching rules for manufacturing job shop operations","volume":"20","author":"Blackstone","year":"1982","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0954-1810(99)00021-7_BIB10","series-title":"Genetic algorithms+data structure=evolution programs","author":"Michalewicz","year":"1992"},{"key":"10.1016\/S0954-1810(99)00021-7_BIB11","unstructured":"Lae J, Park CH. Application of genetic algorithm to job shop scheduling problems with active schedule constructive crossover. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1995. pp. 530\u2013535."},{"issue":"1\u20134","key":"10.1016\/S0954-1810(99)00021-7_BIB12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0360-8352(95)00067-B","article-title":"Real-world scheduling problem using genetic algorithms","volume":"29","author":"Gilkinson","year":"1995","journal-title":"Computers & Industrial Engineering"},{"issue":"1\u20134","key":"10.1016\/S0954-1810(99)00021-7_BIB13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0360-8352(90)90082-W","article-title":"Genetic algorithms and job shop scheduling","volume":"19","author":"Biegel","year":"1990","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/S0954-1810(99)00021-7_BIB14","doi-asserted-by":"crossref","unstructured":"Wang PC, Korfhage W. Process scheduling using genetic algorithms. Proceedings of IEEE Symposium on Parallel and Distributed Processing, 1995. pp. 638\u2013641.","DOI":"10.1109\/SPDP.1995.530742"},{"key":"10.1016\/S0954-1810(99)00021-7_BIB15","doi-asserted-by":"crossref","unstructured":"Sannomiya N, Iima H. Application of genetic algorithm to scheduling problems in manufacturing processes. Proceedings of the IEEE Conference on Evolutionary Computation, 1996. pp. 523\u2013528.","DOI":"10.1109\/ICEC.1996.542654"},{"key":"10.1016\/S0954-1810(99)00021-7_BIB16","series-title":"Genetic algorithms and simulated annealing","year":"1987"},{"key":"10.1016\/S0954-1810(99)00021-7_BIB17","unstructured":"Brindle A. Genetic algorithms for function optimization: Doctoral dissertation, University of Alberta, 1981."}],"container-title":["Artificial Intelligence in Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0954181099000217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0954181099000217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T15:19:51Z","timestamp":1580915991000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0954181099000217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,10]]}},"alternative-id":["S0954181099000217"],"URL":"https:\/\/doi.org\/10.1016\/s0954-1810(99)00021-7","relation":{},"ISSN":["0954-1810"],"issn-type":[{"value":"0954-1810","type":"print"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}