{"id":"https://openalex.org/W1983585007","doi":"https://doi.org/10.1109/cdc.2012.6426912","title":"A greedy algorithm for computing finite-makespan controllable sublanguages","display_name":"A greedy algorithm for computing finite-makespan controllable sublanguages","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W1983585007","doi":"https://doi.org/10.1109/cdc.2012.6426912","mag":"1983585007"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2012.6426912","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2012.6426912","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 51st IEEE Conference on Decision and Control (CDC)","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/A5046844818","display_name":"Rong Su","orcid":"https://orcid.org/0000-0003-3448-0586"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Rong Su","raw_affiliation_strings":["Division of Control and Instrumentation, School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore","Division of Control and Instrumentation, School of Electrical and Electronic Engineering, Nanyang technological University, 50 Nanyang Avenue, Singapore 639798"],"affiliations":[{"raw_affiliation_string":"Division of Control and Instrumentation, School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"Division of Control and Instrumentation, School of Electrical and Electronic Engineering, Nanyang technological University, 50 Nanyang Avenue, Singapore 639798","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046844818"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":2.0544,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.87380056,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"55","issue":null,"first_page":"7360","last_page":"7365"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9986000061035156,"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.9986000061035156,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11741","display_name":"Flexible and Reconfigurable Manufacturing Systems","score":0.996399998664856,"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/sublanguage","display_name":"Sublanguage","score":0.938805341720581},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.864138662815094},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6322741508483887},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5375845432281494},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5025155544281006},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4663841724395752},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46601608395576477},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45638445019721985},{"id":"https://openalex.org/keywords/controllability","display_name":"Controllability","score":0.4223366379737854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29111215472221375},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11490136384963989},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.06729963421821594},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.052673935890197754}],"concepts":[{"id":"https://openalex.org/C2776411971","wikidata":"https://www.wikidata.org/wiki/Q17141398","display_name":"Sublanguage","level":2,"score":0.938805341720581},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.864138662815094},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6322741508483887},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5375845432281494},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5025155544281006},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4663841724395752},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46601608395576477},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45638445019721985},{"id":"https://openalex.org/C48209547","wikidata":"https://www.wikidata.org/wiki/Q1331104","display_name":"Controllability","level":2,"score":0.4223366379737854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29111215472221375},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11490136384963989},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.06729963421821594},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.052673935890197754},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cdc.2012.6426912","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2012.6426912","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 51st IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},{"id":"pmh:oai:dr.ntu.edu.sg:10356/84659","is_oa":false,"landing_page_url":"http://hdl.handle.net/10220/12502","pdf_url":null,"source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1500110201","https://openalex.org/W1567707156","https://openalex.org/W1589082502","https://openalex.org/W1606824214","https://openalex.org/W1607040248","https://openalex.org/W1979349468","https://openalex.org/W2044943300","https://openalex.org/W2059057465","https://openalex.org/W2082516436","https://openalex.org/W2101508170","https://openalex.org/W2114294750","https://openalex.org/W2125393216","https://openalex.org/W2126295866","https://openalex.org/W2144965436","https://openalex.org/W2489145936","https://openalex.org/W3161476343","https://openalex.org/W6629885830","https://openalex.org/W6633910192","https://openalex.org/W6635336190","https://openalex.org/W6636503133","https://openalex.org/W6681401544"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W1983585007","https://openalex.org/W2103794536"],"abstract_inverted_index":{"The":[0],"Ramadge-Wonham":[1],"supervisory":[2],"control":[3,31],"paradigm":[4],"has":[5,33,45,50],"been":[6,34,46,51],"shown":[7,52],"effective":[8],"in":[9,24],"dealing":[10],"with":[11],"logic":[12],"control.":[13],"Nevertheless,":[14],"time-related":[15],"performance":[16],"is":[17,60],"always":[18],"one":[19],"of":[20,104,127],"the":[21,80,84,89,105,125],"major":[22],"concerns":[23],"industry.":[25],"Recently,":[26],"a":[27,41,56,69,74,95,100,113],"new":[28],"time":[29],"optimal":[30],"framework":[32],"proposed,":[35],"and":[36,88],"an":[37],"algorithm":[38,71,97],"for":[39],"synthesizing":[40],"minimum-makespan":[42,57],"controllable":[43,58,76],"sublanguage":[44,59],"provided.":[47],"But":[48],"it":[49],"that":[53,72,109],"computing":[54,111],"such":[55,112],"NP-hard.":[61],"To":[62,78],"avoid":[63],"this":[64],"complexity":[65],"issue,":[66],"we":[67,93],"present":[68],"polynomial-time":[70,96],"computes":[73],"finite-makespan":[75],"sublanguage.":[77],"evaluate":[79],"potential":[81],"difference":[82],"between":[83],"attained":[85],"finite":[86],"makespan":[87,107,115],"actual":[90],"minimum":[91,106,114],"makespan,":[92],"provide":[94],"to":[98,123],"compute":[99],"strictly":[101],"lower":[102],"bound":[103],"so":[108],"explicitly":[110],"can":[116],"be":[117],"avoided.":[118],"Experimental":[119],"results":[120],"are":[121],"provided":[122],"show":[124],"effectiveness":[126],"our":[128],"algorithms.":[129]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}