{"id":"https://openalex.org/W1542776950","doi":"https://doi.org/10.1109/icsmc.2003.1244307","title":"On-line scheduling of robotic cells with post-processing residency constraints","display_name":"On-line scheduling of robotic cells with post-processing residency constraints","publication_year":2004,"publication_date":"2004-05-13","ids":{"openalex":"https://openalex.org/W1542776950","doi":"https://doi.org/10.1109/icsmc.2003.1244307","mag":"1542776950"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2003.1244307","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2003.1244307","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483)","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/A5107048047","display_name":"Hyun Joong Yoon","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Hyun Joong Yoon","raw_affiliation_strings":["Department of Mechanical Engineering, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea","Dept. of Mech. Eng., Korea Adv. Inst. of Sci. & Technol., Daejeon, South Korea#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Dept. of Mech. Eng., Korea Adv. Inst. of Sci. & Technol., Daejeon, South Korea#TAB#","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077801101","display_name":"Doo Yong Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Doo Yong Lee","raw_affiliation_strings":["Department of Mechanical Engineering, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea","Dept. of Mech. Eng., Korea Adv. Inst. of Sci. & Technol., Daejeon, South Korea#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Dept. of Mech. Eng., Korea Adv. Inst. of Sci. & Technol., Daejeon, South Korea#TAB#","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5107048047"],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":0.8391,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.76080055,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"3","issue":null,"first_page":"2785","last_page":"2790"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9984999895095825,"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.9984999895095825,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9965999722480774,"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/T12288","display_name":"Optimization and Search Problems","score":0.9879000186920166,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7405646443367004},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6473829746246338},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5699949860572815},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5545583367347717},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4781932830810547},{"id":"https://openalex.org/keywords/formalism","display_name":"Formalism (music)","score":0.4674319624900818},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46644872426986694},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4229659140110016},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36158204078674316},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3482513129711151},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3077363967895508},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22962751984596252},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.09024447202682495}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7405646443367004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6473829746246338},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5699949860572815},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5545583367347717},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4781932830810547},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.4674319624900818},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46644872426986694},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4229659140110016},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36158204078674316},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3482513129711151},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3077363967895508},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22962751984596252},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.09024447202682495},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C558565934","wikidata":"https://www.wikidata.org/wiki/Q2743","display_name":"Musical","level":2,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icsmc.2003.1244307","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2003.1244307","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1977973525","https://openalex.org/W2029381856","https://openalex.org/W2071530270","https://openalex.org/W2083808640","https://openalex.org/W2105249527","https://openalex.org/W2127104083","https://openalex.org/W2130182605","https://openalex.org/W2131087757","https://openalex.org/W2131433807","https://openalex.org/W2143672743","https://openalex.org/W2148039735","https://openalex.org/W2171514102","https://openalex.org/W2315958334","https://openalex.org/W2752885492","https://openalex.org/W2888871578","https://openalex.org/W2911317503"],"related_works":["https://openalex.org/W2404647514","https://openalex.org/W1667647204","https://openalex.org/W4247536566","https://openalex.org/W2018477250","https://openalex.org/W3119814709","https://openalex.org/W4241418540","https://openalex.org/W1508895727","https://openalex.org/W4391009474","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"the":[3,73,77,86,91,95,99],"problem":[4,19],"of":[5,8,45,85,94,98],"on-line":[6,33,41],"scheduling":[7,18,34,42,87],"robotic":[9],"cells":[10],"with":[11,20,36],"post-processing":[12],"residency":[13],"constraints.":[14],"We":[15,101],"model":[16],"this":[17],"temporal":[21,68],"constraints":[22],"using":[23],"Dechter,":[24],"Meiri,":[25],"and":[26,49,67],"Pearl's":[27],"formalism.":[28],"Then,":[29],"we":[30],"present":[31],"an":[32],"algorithm":[35,43],"polynomial":[37,107],"computational":[38],"complexity.":[39,108],"The":[40,52,70,83],"consists":[44],"FEASIBLE/spl":[46],"I.bar/SCHED/spl":[47],"I.bar/SPACE":[48],"OPTIMAL/spl":[50],"I.bar/SCHED.":[51],"former":[53],"finds":[54],"feasible":[55,78],"solution":[56,75,79],"space":[57,80],"for":[58],"a":[59],"newly":[60],"inserted":[61],"part,":[62],"which":[63],"guarantees":[64],"both":[65],"logical":[66],"correctness.":[69],"latter":[71],"computes":[72],"optimal":[74],"in":[76],"obtained":[81],"previously.":[82],"objective":[84],"is":[88],"to":[89],"minimize":[90],"completion":[92],"time":[93],"last":[96],"operation":[97],"part.":[100],"prove":[102],"that":[103],"each":[104],"procedure":[105],"has":[106]},"counts_by_year":[{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}