{"id":"https://openalex.org/W3046603986","doi":"https://doi.org/10.1145/3377929.3398150","title":"Scheduling unrelated parallel machines with family setups and resource constraints to minimize total tardiness","display_name":"Scheduling unrelated parallel machines with family setups and resource constraints to minimize total tardiness","publication_year":2020,"publication_date":"2020-07-08","ids":{"openalex":"https://openalex.org/W3046603986","doi":"https://doi.org/10.1145/3377929.3398150","mag":"3046603986"},"language":"en","primary_location":{"id":"doi:10.1145/3377929.3398150","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3377929.3398150","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054515120","display_name":"J\u00falio C. S. N. Pinheiro","orcid":null},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"J\u00falio C. S. N. Pinheiro","raw_affiliation_strings":["Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil","institution_ids":["https://openalex.org/I146165071"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048750231","display_name":"Jos\u00e9 Elias Claudio Arroyo","orcid":"https://orcid.org/0000-0003-3403-4770"},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jos\u00e9 Elias C. Arroyo","raw_affiliation_strings":["Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil","institution_ids":["https://openalex.org/I146165071"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055599334","display_name":"Lucas Batista Fialho","orcid":null},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Lucas Batista Fialho","raw_affiliation_strings":["Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil","institution_ids":["https://openalex.org/I146165071"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054515120"],"corresponding_institution_ids":["https://openalex.org/I146165071"],"apc_list":null,"apc_paid":null,"fwci":1.6048,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.86386777,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1409","last_page":"1417"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9822999835014343,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.9072444438934326},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7041031122207642},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6939041614532471},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6679279804229736},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6471073031425476},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5561613440513611},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5471287965774536},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5420132875442505},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34358906745910645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2317376732826233},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18054234981536865}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9072444438934326},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7041031122207642},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6939041614532471},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6679279804229736},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6471073031425476},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5561613440513611},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5471287965774536},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5420132875442505},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34358906745910645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2317376732826233},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18054234981536865},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3377929.3398150","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3377929.3398150","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5699999928474426,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W781042619","https://openalex.org/W1465950394","https://openalex.org/W1976296261","https://openalex.org/W1981549570","https://openalex.org/W2006751452","https://openalex.org/W2013315474","https://openalex.org/W2030250600","https://openalex.org/W2039608886","https://openalex.org/W2058371496","https://openalex.org/W2069533632","https://openalex.org/W2360717914","https://openalex.org/W2513987709","https://openalex.org/W2565602734","https://openalex.org/W2577909561","https://openalex.org/W2590959390","https://openalex.org/W2759351914","https://openalex.org/W2767400733","https://openalex.org/W2805365586","https://openalex.org/W2887704695","https://openalex.org/W2898688448","https://openalex.org/W2953808804","https://openalex.org/W2962688132","https://openalex.org/W2973381151","https://openalex.org/W2980595497","https://openalex.org/W2999083279","https://openalex.org/W2999208346","https://openalex.org/W4247589463"],"related_works":["https://openalex.org/W2011810134","https://openalex.org/W2050497389","https://openalex.org/W1568976062","https://openalex.org/W2960025371","https://openalex.org/W2367625138","https://openalex.org/W2019537266","https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W74759090"],"abstract_inverted_index":{"This":[0],"work":[1],"considers":[2],"the":[3,59,68,77,80,84,88,112,141,149],"unrelated":[4],"parallel":[5],"machines":[6,81],"scheduling":[7],"problem":[8,113],"with":[9],"family":[10],"setups":[11],"and":[12,23,134],"resource":[13,44,56,69],"constraints.":[14],"In":[15,92],"this":[16],"problem,":[17,119],"jobs":[18,29,60,78,89],"are":[19,26],"grouped":[20],"into":[21],"families":[22],"setup":[24],"times":[25],"required":[27],"between":[28],"belonging":[30],"to":[31,75,94,120,148],"different":[32],"families.":[33],"The":[34,54,72],"processing":[35],"of":[36,43,87],"a":[37,40,46,63,102,115],"job":[38],"requires":[39],"certain":[41],"amount":[42],"from":[45],"machine,":[47],"which":[48],"is":[49,74,90,109,114],"supplied":[50],"by":[51,58],"upstream":[52],"processes.":[53],"total":[55,85],"consumed":[57],"processed":[61],"on":[62,79,131],"machine":[64],"must":[65],"not":[66],"exceed":[67],"supply":[70],"up.":[71],"objective":[73],"schedule":[76],"so":[82],"that":[83,140],"tardiness":[86],"minimized.":[91],"attempting":[93],"obtain":[95,121],"optimal":[96,123],"solutions":[97,124],"for":[98],"small":[99],"size":[100],"instances,":[101],"mixed":[103],"integer":[104],"linear":[105],"programming":[106],"(MILP)":[107],"model":[108],"proposed.":[110],"Since":[111],"NP-hard":[116],"combinatorial":[117],"optimization":[118],"near":[122],"we":[125],"develop":[126],"two":[127],"meta-heuristic":[128],"algorithms":[129,143],"based":[130],"Simulated":[132],"Annealing":[133],"Iterated":[135],"Greedy.":[136],"Computational":[137],"experiments":[138],"show":[139],"presented":[142],"can":[144],"be":[145],"successfully":[146],"applied":[147],"problem.":[150]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}