{"id":"https://openalex.org/W2102022835","doi":"https://doi.org/10.1109/coase.2007.4341833","title":"Lot Dispatching and Scheduling Integrating OHT Traffic Information in the 300mm Wafer Fab","display_name":"Lot Dispatching and Scheduling Integrating OHT Traffic Information in the 300mm Wafer Fab","publication_year":2007,"publication_date":"2007-09-01","ids":{"openalex":"https://openalex.org/W2102022835","doi":"https://doi.org/10.1109/coase.2007.4341833","mag":"2102022835"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2007.4341833","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2007.4341833","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 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/A5003549123","display_name":"How-Wei Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"How-Wei Huang","raw_affiliation_strings":["National Taiwan University, Taipei, Taiwan","National Taiwan University, Taipei,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I16733864"]},{"raw_affiliation_string":"National Taiwan University, Taipei,","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011378943","display_name":"Ching-Hu Lu","orcid":"https://orcid.org/0000-0003-4135-2312"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Ching-Hu Lu","raw_affiliation_strings":["National Taiwan University, Taipei, Taiwan","National Taiwan University, Taipei,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I16733864"]},{"raw_affiliation_string":"National Taiwan University, Taipei,","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101925654","display_name":"Li\u2010Chen Fu","orcid":"https://orcid.org/0000-0002-6947-7646"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]},{"id":"https://openalex.org/I22442739","display_name":"University of Taipei","ror":"https://ror.org/039e7bg24","country_code":"TW","type":"education","lineage":["https://openalex.org/I22442739"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Li-Chen Fu","raw_affiliation_strings":["Department of Electrical Engineering, Taipei, Taiwan","Fellow, IEEE, Department of Computer Science & Information Engineering and the Department of Electrical Engineering, Taipei, Taiwan, R.O.C. e-mail: lichen@ntu.edu.tw"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Taipei, Taiwan","institution_ids":["https://openalex.org/I22442739"]},{"raw_affiliation_string":"Fellow, IEEE, Department of Computer Science & Information Engineering and the Department of Electrical Engineering, Taipei, Taiwan, R.O.C. e-mail: lichen@ntu.edu.tw","institution_ids":["https://openalex.org/I16733864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"495","last_page":"500"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","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/T10551","display_name":"Scheduling and Optimization Algorithms","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/T12176","display_name":"Optimization and Packing Problems","score":0.9980000257492065,"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.6638185381889343},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.6317383050918579},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5579513907432556},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5366043448448181},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.535248339176178},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.5132269859313965},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4827253520488739},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4731910228729248},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.46862179040908813},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4482800364494324},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.43074798583984375},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.42764997482299805},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3672022521495819},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.328632116317749},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.18377849459648132},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16984084248542786},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1406373679637909},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11046582460403442},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.10578316450119019},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09094712138175964}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6638185381889343},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.6317383050918579},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5579513907432556},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5366043448448181},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.535248339176178},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5132269859313965},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4827253520488739},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4731910228729248},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.46862179040908813},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4482800364494324},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.43074798583984375},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.42764997482299805},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3672022521495819},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.328632116317749},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.18377849459648132},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16984084248542786},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1406373679637909},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11046582460403442},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10578316450119019},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09094712138175964},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coase.2007.4341833","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2007.4341833","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Conference on Automation Science and Engineering","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":14,"referenced_works":["https://openalex.org/W1938730082","https://openalex.org/W1994569469","https://openalex.org/W2084729186","https://openalex.org/W2097984481","https://openalex.org/W2118138832","https://openalex.org/W2119285982","https://openalex.org/W2125697860","https://openalex.org/W2137333349","https://openalex.org/W2152005040","https://openalex.org/W2158703918","https://openalex.org/W2165008631","https://openalex.org/W2171856390","https://openalex.org/W2316039394","https://openalex.org/W6640465739"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"In":[0,48,104],"this":[1],"paper,":[2],"we":[3,53,109,126,161],"focus":[4,54,110],"on":[5,55,111],"the":[6,35,40,44,49,56,87,95,105,112,118,133,136,145,153,164],"lot":[7,24,57],"dispatching":[8,11,25,28,46,58,102,107,114],"and":[9,26,39,73,125],"vehicle":[10,27,113],"problems":[12],"in":[13,100,157],"a":[14,21,62,140],"300":[15],"mm":[16],"wafer":[17],"fab.":[18],"We":[19,60,116],"propose":[20,61],"two":[22],"phase":[23,33,38,42],"integrated":[29],"algorithm.":[30],"The":[31],"first":[32],"is":[34,43,83,98],"offline":[36,50],"optimization":[37,51],"second":[41],"online":[45,101,106],"phase.":[47,103],"phase,":[52,108],"problem.":[59,115],"scheduler":[63],"which":[64],"can":[65],"search":[66,162],"for":[67,152,163],"appropriate":[68],"weights":[69],"of":[70,90,135,138],"several":[71],"rules":[72],"combines":[74],"them":[75],"into":[76,123],"one":[77],"mixed":[78,96],"rule.":[79],"Genetic":[80],"algorithm":[81],"(GA)":[82],"used":[84,99],"to":[85,131],"find":[86],"optimal":[88],"combination":[89],"these":[91],"heuristic":[92],"rules.":[93],"And":[94],"rule":[97],"take":[117],"real":[119],"time":[120],"traffic":[121,159],"information":[122],"consideration":[124],"apply":[127],"Markov":[128],"decision":[129],"model":[130,132,160],"estimate":[134],"cost":[137],"traversing":[139],"congested":[141],"edge.":[142],"Compared":[143],"with":[144,166],"traditional":[146],"shortest":[147,154],"path":[148,165],"method":[149],"that":[150],"searches":[151],"distance":[155],"path,":[156],"our":[158],"least":[167],"expected":[168],"travel":[169],"time.":[170]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}