{"id":"https://openalex.org/W2164931233","doi":"https://doi.org/10.1109/case.2011.6042518","title":"Scheduling of cluster tools with ready time constraints for small lot production","display_name":"Scheduling of cluster tools with ready time constraints for small lot production","publication_year":2011,"publication_date":"2011-08-01","ids":{"openalex":"https://openalex.org/W2164931233","doi":"https://doi.org/10.1109/case.2011.6042518","mag":"2164931233"},"language":"en","primary_location":{"id":"doi:10.1109/case.2011.6042518","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case.2011.6042518","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 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/A5100439521","display_name":"Hyun-Jung Kim","orcid":"https://orcid.org/0000-0001-7190-3264"},"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":"Hyun-Jung Kim","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014167840","display_name":"Tae\u2010Eog Lee","orcid":"https://orcid.org/0000-0003-0885-6359"},"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":"Tae-Eog Lee","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"47","issue":null,"first_page":"96","last_page":"101"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9991000294685364,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.9973000288009644,"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/petri-net","display_name":"Petri net","score":0.7348840236663818},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6977099180221558},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6964863538742065},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6831759810447693},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.602948009967804},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5196691751480103},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5196327567100525},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.49952173233032227},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.48238125443458557},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.481484055519104},{"id":"https://openalex.org/keywords/wafer","display_name":"Wafer","score":0.4642098546028137},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4338802695274353},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4279502034187317},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.41614794731140137},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35892537236213684},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19623950123786926},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1506349742412567}],"concepts":[{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.7348840236663818},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6977099180221558},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6964863538742065},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6831759810447693},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.602948009967804},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5196691751480103},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5196327567100525},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.49952173233032227},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.48238125443458557},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.481484055519104},{"id":"https://openalex.org/C160671074","wikidata":"https://www.wikidata.org/wiki/Q267131","display_name":"Wafer","level":2,"score":0.4642098546028137},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4338802695274353},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4279502034187317},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.41614794731140137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35892537236213684},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19623950123786926},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1506349742412567},{"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/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/case.2011.6042518","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case.2011.6042518","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Automation Science and Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.46000000834465027,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W606103426","https://openalex.org/W1519440793","https://openalex.org/W1967026525","https://openalex.org/W1981704280","https://openalex.org/W2011121744","https://openalex.org/W2023770634","https://openalex.org/W2048928932","https://openalex.org/W2069457805","https://openalex.org/W2106659191","https://openalex.org/W2109845613","https://openalex.org/W2110050374","https://openalex.org/W2112161942","https://openalex.org/W2122967269","https://openalex.org/W2130315453","https://openalex.org/W2137987710","https://openalex.org/W2141103600","https://openalex.org/W2153278771","https://openalex.org/W2245323894","https://openalex.org/W3124296027","https://openalex.org/W3124318612","https://openalex.org/W3125400005","https://openalex.org/W4213373825","https://openalex.org/W4231526486","https://openalex.org/W4242037947","https://openalex.org/W6641845676","https://openalex.org/W6690512060"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2225350526","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2167574351","https://openalex.org/W3036719625","https://openalex.org/W2367142822","https://openalex.org/W2978148977"],"abstract_inverted_index":{"We":[0,90],"examine":[1,92],"a":[2,93,128,134,140,153,160,176,196,243],"scheduling":[3,15,27,62,95,124,185],"problem":[4,186],"regarding":[5],"cluster":[6,17,98],"tools":[7,18,99],"for":[8,63,97,139,166,187,195],"small":[9,65,77],"lot":[10,36,66],"production.":[11],"Most":[12],"work":[13,31,73],"on":[14,104,146],"of":[16,71,83,207,256],"assumed":[19],"large":[20],"identical":[21,30,53,72],"wafer":[22],"lots,":[23],"and":[24,86,107,136,159,224],"examined":[25],"cyclic":[26,61],"that":[28,171,216,233],"repeats":[29],"cycles.":[32],"However,":[33,194],"nowadays,":[34],"the":[35,69,81,84,105,108,112,118,147,173,179,184,199,205,219,225,234],"size":[37],"tends":[38],"to":[39,59,80,191],"be":[40,250],"extremely":[41],"small,":[42],"even":[43,252],"being":[44],"only":[45,218],"5-8":[46],"wafers":[47,208,222,227,258],"whereas":[48],"conventional":[49],"lots":[50,188,255],"have":[51],"25":[52,192,257],"wafers.":[54,193],"It":[55],"is":[56,75,133],"not":[57],"reasonable":[58],"use":[60],"such":[64],"production":[67],"because":[68],"number":[70,206],"cycles":[74],"too":[76],"as":[78,204],"compared":[79],"lengths":[82],"starting":[85],"closing":[87],"transient":[88],"periods.":[89],"therefore":[91],"new":[94],"method":[96,138,215,236],"with":[100,189,240],"ready":[101],"time":[102,201],"constraints":[103],"chambers":[106],"robot,":[109],"from":[110,116],"which":[111,132],"resources":[113],"are":[114,259],"freed":[115],"processing":[117],"preceding":[119],"lot.":[120],"To":[121],"solve":[122,183],"this":[123],"problem,":[125],"we":[126,151,211,231],"develop":[127,152],"Petri":[129,148],"net":[130,149],"model":[131,158],"graphical":[135],"mathematical":[137],"discrete":[141],"event":[142],"dynamic":[143],"system.":[144],"Based":[145],"model,":[150],"mixed":[154],"integer":[155],"programming":[156],"(MIP)":[157],"branch":[161],"&":[162],"bound":[163],"(B&B)":[164],"algorithm":[165,180],"determining":[167],"an":[168,213],"optimal":[169],"schedule":[170],"minimizes":[172],"makespan.":[174],"For":[175],"single-armed":[177],"tool,":[178,198],"can":[181,249],"efficiently":[182],"up":[190],"dual-armed":[197],"computation":[200],"grows":[202],"quickly":[203],"increases.":[209],"Therefore,":[210],"propose":[212],"approximate":[214,235],"schedules":[217],"first":[220],"few":[221],"non-cyclically":[223],"remaining":[226],"cyclically.":[228],"From":[229],"experiments,":[230],"conclude":[232],"provides":[237],"good":[238],"solutions":[239],"less":[241],"than":[242],"1%":[244],"error.":[245],"The":[246],"proposed":[247],"methods":[248],"used":[251],"when":[253],"full":[254],"frequently":[260],"switched.":[261]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}