{"id":"https://openalex.org/W2008021786","doi":"https://doi.org/10.1145/1543834.1543903","title":"Adaptive representation for flexible job-shop scheduling and rescheduling","display_name":"Adaptive representation for flexible job-shop scheduling and rescheduling","publication_year":2009,"publication_date":"2009-06-12","ids":{"openalex":"https://openalex.org/W2008021786","doi":"https://doi.org/10.1145/1543834.1543903","mag":"2008021786"},"language":"en","primary_location":{"id":"doi:10.1145/1543834.1543903","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1543834.1543903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation","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/A5008896177","display_name":"Prakarn Unachak","orcid":null},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Prakarn Unachak","raw_affiliation_strings":["Michigan State University, East Lansing, MI, USA"],"affiliations":[{"raw_affiliation_string":"Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034853476","display_name":"Erik D. Goodman","orcid":"https://orcid.org/0000-0002-2419-0692"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Erik Goodman","raw_affiliation_strings":["Michigan State University, East Lansing, MI, USA"],"affiliations":[{"raw_affiliation_string":"Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008896177"],"corresponding_institution_ids":["https://openalex.org/I87216513"],"apc_list":null,"apc_paid":null,"fwci":0.7505,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.76334301,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"511","last_page":"516"},"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.9922000169754028,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9908000230789185,"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/computer-science","display_name":"Computer science","score":0.7428039312362671},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7387782335281372},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5861462354660034},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5511851906776428},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5167685747146606},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4985949993133545},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4953097403049469},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4878537654876709},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4862600564956665},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.4605748653411865},{"id":"https://openalex.org/keywords/commit","display_name":"Commit","score":0.44665828347206116},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4442913830280304},{"id":"https://openalex.org/keywords/open-shop-scheduling","display_name":"Open-shop scheduling","score":0.41329723596572876},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3305172324180603},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13912692666053772},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09768325090408325}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7428039312362671},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7387782335281372},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5861462354660034},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5511851906776428},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5167685747146606},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4985949993133545},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4953097403049469},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4878537654876709},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4862600564956665},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.4605748653411865},{"id":"https://openalex.org/C153180980","wikidata":"https://www.wikidata.org/wiki/Q19776675","display_name":"Commit","level":2,"score":0.44665828347206116},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4442913830280304},{"id":"https://openalex.org/C35799125","wikidata":"https://www.wikidata.org/wiki/Q7095711","display_name":"Open-shop scheduling","level":5,"score":0.41329723596572876},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3305172324180603},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13912692666053772},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09768325090408325},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0},{"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1543834.1543903","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1543834.1543903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5099999904632568,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1588382077","https://openalex.org/W1964684856","https://openalex.org/W1967271207","https://openalex.org/W1970176495","https://openalex.org/W1996467378","https://openalex.org/W2000099188","https://openalex.org/W2014034914","https://openalex.org/W2037678563","https://openalex.org/W2076785727","https://openalex.org/W2095446888","https://openalex.org/W2095956067","https://openalex.org/W2102620188","https://openalex.org/W2107125002","https://openalex.org/W2126105956","https://openalex.org/W2150322710","https://openalex.org/W2153962305","https://openalex.org/W2166900052","https://openalex.org/W3003667158","https://openalex.org/W3010521158"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2838819579","https://openalex.org/W131757205","https://openalex.org/W2807934311","https://openalex.org/W2533899164","https://openalex.org/W2155809154","https://openalex.org/W2057737420","https://openalex.org/W2596081411","https://openalex.org/W2384952691","https://openalex.org/W2949165180"],"abstract_inverted_index":{"The":[0],"flexible":[1],"job-shop":[2],"scheduling":[3,12,22,70,124],"problem":[4],"(FJSP)":[5],"is":[6,132],"one":[7],"of":[8,31,84,105],"the":[9,52,56,69,89,98,102,106,123],"most":[10],"popular":[11],"problems,":[13,23],"due":[14],"to":[15,20,41,55,100,114],"its":[16,25],"relative":[17],"simplicity,":[18],"compared":[19],"real-world":[21],"and":[24,45],"NP-hardness.":[26],"There":[27],"are":[28],"two":[29],"types":[30],"decisions":[32,67],"involved":[33],"in":[34,51,122],"solving":[35],"FJSP":[36],"problems:":[37],"(1)":[38],"assigning":[39,47,111],"machines":[40,54],"operations,":[42,57],"or":[43,58],"routing,":[44],"(2)":[46],"a":[48,112],"time":[49],"slot":[50],"assigned":[53],"scheduling.":[59],"Most":[60],"approaches":[61],"commit":[62],"all":[63],"routing":[64,81,91],"(machine":[65],"assignment)":[66],"before":[68,110],"process.":[71,125],"Our":[72],"proposed":[73],"representation,":[74],"AdRep,":[75],"encodes":[76],"simple":[77],"heuristics,":[78],"such":[79],"as":[80,133,136],"rules,":[82],"instead":[83],"explicit":[85,90],"machine":[86,113],"assignments,":[87],"delaying":[88],"decision":[92],"until":[93],"absolutely":[94],"necessary.":[95],"This":[96],"allows":[97],"scheduler":[99],"take":[101],"current":[103],"state":[104],"system":[107],"into":[108],"account":[109],"an":[115],"operation.":[116],"We":[117],"also":[118],"utilize":[119],"similar":[120],"paradigms":[121],"Experimental":[126],"results":[127],"show":[128],"that":[129],"our":[130,141],"method":[131,142],"capable,":[134],"makespan-wise,":[135],"other":[137],"published":[138],"methods.":[139],"Also,":[140],"performs":[143],"adequately":[144],"against":[145],"disruption.":[146]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}