{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:18:05Z","timestamp":1783613885305,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"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":[[2020,7,8]]},"DOI":"10.1145\/3377929.3398150","type":"proceedings-article","created":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T15:27:01Z","timestamp":1598455621000},"page":"1409-1417","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Scheduling unrelated parallel machines with family setups and resource constraints to minimize total tardiness"],"prefix":"10.1145","author":[{"given":"J\u00falio C. S. N.","family":"Pinheiro","sequence":"first","affiliation":[{"name":"Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9 Elias C.","family":"Arroyo","sequence":"additional","affiliation":[{"name":"Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lucas Batista","family":"Fialho","sequence":"additional","affiliation":[{"name":"Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Search methodologies","author":"Aarts Emile"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.05.020"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-015-1117-6"},{"key":"e_1_3_2_2_4_1","volume-title":"Comparisons of metaheuristic algorithms for unrelated parallel machine weighted earliness\/tardiness scheduling problems. Evolutionary Intelligence","author":"Ar\u0131k O\u011fuzhan Ahmet","year":"2019"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.10.012"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12046-016-0575-7"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02729109"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.07.023"},{"key":"e_1_3_2_2_9_1","volume-title":"Analysis of Variable Neighborhood Descent as a Local Search Operator for Total Weighted Tardiness Problem on Unrelated Parallel Machines. Computers & Operations Research","author":"Marinho Diana Rodney Oliveira","year":"2020"},{"key":"e_1_3_2_2_10_1","volume-title":"Minimizing total tardiness on one machine is NP-hard. Mathematics of operations research 15, 3","author":"Du Jianzhong","year":"1990"},{"key":"e_1_3_2_2_11_1","volume-title":"Models and an exact method for the unrelated parallel machine scheduling problem with setups and resources. Expert Systems with Applications: X","author":"Fanjul-Peyro Luis","year":"2020"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.01.002"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.03.030"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.07.007"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.05.056"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.07.001"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.08.010"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2017.10.028"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0736-5845(02)00077-7"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-013-5192-6"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-2824-y"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-017-0036-x"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-019-09646-6"},{"key":"e_1_3_2_2_24_1","volume-title":"A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European journal of operational research 177, 3","author":"Ruiz Rub\u00e9n","year":"2007"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.04.001"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.07.016"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.09.054"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112959"}],"event":{"name":"GECCO '20: Genetic and Evolutionary Computation Conference","location":"Canc\u00fan Mexico","acronym":"GECCO '20","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377929.3398150","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377929.3398150","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:07Z","timestamp":1750200067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377929.3398150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":28,"alternative-id":["10.1145\/3377929.3398150","10.1145\/3377929"],"URL":"https:\/\/doi.org\/10.1145\/3377929.3398150","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}