{"id":"https://openalex.org/W2164593331","doi":"https://doi.org/10.1109/coase.2008.4626531","title":"Heuristics to minimize total weighted tardiness of jobs on unrelated parallel machines","display_name":"Heuristics to minimize total weighted tardiness of jobs on unrelated parallel machines","publication_year":2008,"publication_date":"2008-08-01","ids":{"openalex":"https://openalex.org/W2164593331","doi":"https://doi.org/10.1109/coase.2008.4626531","mag":"2164593331"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2008.4626531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2008.4626531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Automation Science and Engineering","raw_type":"proceedings-article"},"type":"conference-paper","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/A5032060363","display_name":"Lars M\u00f6nch","orcid":null},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"FernUniversit\u00e4t in Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"L. Monch","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Hagen, Hagen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Hagen, Hagen, Germany","institution_ids":["https://openalex.org/I120691247"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032060363"],"corresponding_institution_ids":["https://openalex.org/I120691247"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"177","issue":null,"first_page":"572","last_page":"577"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9969000220298767,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9901999831199646,"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.9753009080886841},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7826178669929504},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6768589615821838},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6532900333404541},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6496997475624084},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6278939247131348},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6102148294448853},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5114323496818542},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.48548272252082825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2622118592262268},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.25750720500946045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21539440751075745}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9753009080886841},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7826178669929504},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6768589615821838},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6532900333404541},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6496997475624084},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6278939247131348},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6102148294448853},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5114323496818542},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48548272252082825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2622118592262268},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25750720500946045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21539440751075745},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coase.2008.4626531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2008.4626531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Automation Science and Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W40309320","https://openalex.org/W1196362204","https://openalex.org/W1488422606","https://openalex.org/W1526580552","https://openalex.org/W1592091313","https://openalex.org/W1967568337","https://openalex.org/W1972928373","https://openalex.org/W1978931881","https://openalex.org/W1991370671","https://openalex.org/W2034116395","https://openalex.org/W2074055219","https://openalex.org/W2074589987","https://openalex.org/W2076028784","https://openalex.org/W2077473653","https://openalex.org/W2087418240","https://openalex.org/W2115322778","https://openalex.org/W2155062540","https://openalex.org/W4285719527","https://openalex.org/W6635478367"],"related_works":["https://openalex.org/W1999247335","https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312"],"abstract_inverted_index":{"In":[0],"this":[1,32,106],"paper,":[2],"we":[3,64],"present":[4],"an":[5,21],"efficient":[6],"method":[7],"to":[8,30,42],"solve":[9,31],"unrelated":[10],"parallel":[11],"machine":[12],"total":[13],"weighted":[14],"tardiness":[15,68],"(TWT)":[16],"scheduling":[17,48,90],"problems.":[18],"We":[19,73,93],"apply":[20],"ant":[22],"colony":[23,36],"optimization":[24],"(ACO)":[25],"approach":[26],"as":[27],"a":[28,81,86],"heuristic":[29,55,62,83],"NP-hard":[33],"problem.":[34],"A":[35],"of":[37,46,60,88,105],"artificial":[38,51],"ants":[39],"is":[40],"used":[41],"construct":[43],"iteratively":[44],"solutions":[45],"the":[47,58,61,66,76],"problem":[49],"using":[50],"pheromone":[52],"trails":[53],"and":[54,112],"information.":[56],"For":[57],"computation":[59],"information,":[63],"use":[65],"apparent":[67],"cost":[69],"(ATC)":[70],"dispatching":[71],"rule.":[72],"additionally":[74],"improve":[75],"TWT":[77],"value":[78],"by":[79],"applying":[80],"decomposition":[82],"that":[84],"solves":[85],"sequence":[87],"smaller":[89],"problems":[91],"optimally.":[92],"report":[94],"on":[95,99],"computational":[96],"experiments":[97],"based":[98],"stochastically":[100],"generated":[101],"test":[102],"instances.":[103],"Problems":[104],"type":[107],"arise":[108],"in":[109],"semiconductor":[110],"manufacturing":[111],"have":[113],"great":[114],"practical":[115],"relevance.":[116]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}