{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T21:35:45Z","timestamp":1771018545492,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,7,7]],"date-time":"2012-07-07T00:00:00Z","timestamp":1341619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,7,7]]},"DOI":"10.1145\/2330163.2330332","type":"proceedings-article","created":{"date-parts":[[2012,7,10]],"date-time":"2012-07-10T16:41:12Z","timestamp":1341938472000},"page":"1221-1228","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Evolutionary algorithms for the project scheduling problem"],"prefix":"10.1145","author":[{"given":"Leandro L.","family":"Minku","sequence":"first","affiliation":[{"name":"University of Birmingham, Birmingham, United Kingdom"}]},{"given":"Dirk","family":"Sudholt","sequence":"additional","affiliation":[{"name":"University of Sheffield, Sheffield, United Kingdom"}]},{"given":"Xin","family":"Yao","sequence":"additional","affiliation":[{"name":"University of Birmingham, Birmingham, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2012,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"119","article-title":"Approximate is better than \"exact\" for interval estimation of binomial proportions","volume":"52","author":"Agresti A.","year":"1998","unstructured":"A. Agresti and B. Coull . Approximate is better than \"exact\" for interval estimation of binomial proportions . The American Statistician , 52 : 119 -- 126 , 1998 . A. Agresti and B. Coull. Approximate is better than \"exact\" for interval estimation of binomial proportions. The American Statistician, 52:119--126, 1998.","journal-title":"The American Statistician"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.12.020"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008307.2008322"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012543203763"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2008.03.002"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248548"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885031.1885037"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006350622830"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/smr.v20:5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001808"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_14_1","volume-title":"Bioinspired Computation in Combinatorial Optimization -- Algorithms and Their Computational Complexity","author":"Neumann F.","year":"2010","unstructured":"F. Neumann and C. Witt . Bioinspired Computation in Combinatorial Optimization -- Algorithms and Their Computational Complexity . Springer , 2010 . F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization -- Algorithms and Their Computational Complexity. Springer, 2010."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11633-007-0281-3"}],"event":{"name":"GECCO '12: Genetic and Evolutionary Computation Conference","location":"Philadelphia Pennsylvania USA","acronym":"GECCO '12","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 14th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2330163.2330332","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2330163.2330332","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:09Z","timestamp":1750236549000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2330163.2330332"}},"subtitle":["runtime analysis and improved design"],"short-title":[],"issued":{"date-parts":[[2012,7,7]]},"references-count":13,"alternative-id":["10.1145\/2330163.2330332","10.1145\/2330163"],"URL":"https:\/\/doi.org\/10.1145\/2330163.2330332","relation":{},"subject":[],"published":{"date-parts":[[2012,7,7]]},"assertion":[{"value":"2012-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}