{"id":"https://openalex.org/W3142884250","doi":"https://doi.org/10.1109/wsc48552.2020.9384127","title":"Heuristics for Order-Lot Pegging In Multi-Fab Settings","display_name":"Heuristics for Order-Lot Pegging In Multi-Fab Settings","publication_year":2020,"publication_date":"2020-12-14","ids":{"openalex":"https://openalex.org/W3142884250","doi":"https://doi.org/10.1109/wsc48552.2020.9384127","mag":"3142884250"},"language":"en","primary_location":{"id":"doi:10.1109/wsc48552.2020.9384127","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc48552.2020.9384127","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 Winter Simulation Conference (WSC)","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/A5032060363","display_name":"Lars M\u00f6nch","orcid":null},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"University of Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Lars Monch","raw_affiliation_strings":["University of Hagen, Hagen, GERMANY"],"affiliations":[{"raw_affiliation_string":"University of Hagen, Hagen, GERMANY","institution_ids":["https://openalex.org/I120691247"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088717025","display_name":"Liji Shen","orcid":"https://orcid.org/0000-0001-5081-1715"},"institutions":[{"id":"https://openalex.org/I4210119460","display_name":"Sitma (Norway)","ror":"https://ror.org/02hzxf772","country_code":"NO","type":"company","lineage":["https://openalex.org/I4210119460"]},{"id":"https://openalex.org/I84340266","display_name":"WHU \u2013 Otto Beisheim School of Management","ror":"https://ror.org/01yhahq71","country_code":"DE","type":"education","lineage":["https://openalex.org/I84340266"]}],"countries":["DE","NO"],"is_corresponding":false,"raw_author_name":"Liji Shen","raw_affiliation_strings":["Supply Chain Management Group, WHU - Otto Beisheim School of Management, GERMANY"],"affiliations":[{"raw_affiliation_string":"Supply Chain Management Group, WHU - Otto Beisheim School of Management, GERMANY","institution_ids":["https://openalex.org/I84340266","https://openalex.org/I4210119460"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019888542","display_name":"John Fowler","orcid":"https://orcid.org/0000-0002-7112-8031"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John W. Fowler","raw_affiliation_strings":["Arizona State University, Tempe, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032060363"],"corresponding_institution_ids":["https://openalex.org/I120691247"],"apc_list":null,"apc_paid":null,"fwci":0.3566,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.70854142,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1742","last_page":"1752"},"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.9995999932289124,"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.9994000196456909,"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/tardiness","display_name":"Tardiness","score":0.9279488325119019},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8249731063842773},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6696800589561462},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.630602240562439},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6277546882629395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.627090334892273},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5879389047622681},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4874430000782013},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.46091702580451965},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4583745002746582},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24815130233764648},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.1857527792453766},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16904348134994507}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9279488325119019},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8249731063842773},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6696800589561462},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.630602240562439},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6277546882629395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.627090334892273},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5879389047622681},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4874430000782013},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.46091702580451965},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4583745002746582},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24815130233764648},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.1857527792453766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16904348134994507},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wsc48552.2020.9384127","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc48552.2020.9384127","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 Winter Simulation Conference (WSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.47999998927116394,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1545722440","https://openalex.org/W1964047950","https://openalex.org/W1970350858","https://openalex.org/W1970994421","https://openalex.org/W2045911414","https://openalex.org/W2057200550","https://openalex.org/W2057414700","https://openalex.org/W2073993674","https://openalex.org/W2097366043","https://openalex.org/W2153386665","https://openalex.org/W2153459888","https://openalex.org/W2156659802","https://openalex.org/W2168079536","https://openalex.org/W2170909621","https://openalex.org/W2487507777","https://openalex.org/W2616804298","https://openalex.org/W2769895819","https://openalex.org/W2770860928","https://openalex.org/W3096227837","https://openalex.org/W6682769190"],"related_works":["https://openalex.org/W1999247335","https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W4232431455"],"abstract_inverted_index":{"In":[0],"this":[1,57],"paper,":[2],"we":[3,60],"study":[4],"order-lot":[5],"pegging":[6],"problems":[7],"in":[8,113],"semiconductor":[9],"supply":[10],"chains.":[11],"The":[12,36,100],"problem":[13,81],"deals":[14],"with":[15,23],"assigning":[16],"already":[17],"released":[18],"lots":[19],"to":[20,27,39,109],"orders":[21,29],"and":[22,69,90],"planning":[24],"wafer":[25],"releases":[26],"fulfill":[28],"if":[30],"there":[31],"are":[32,98],"not":[33],"enough":[34],"lots.":[35],"objective":[37],"is":[38,107],"minimize":[40],"the":[41,45,84,87,95,104],"total":[42],"tardiness":[43],"of":[44,117],"orders.":[46],"We":[47],"propose":[48],"a":[49,62,70,114],"mixed":[50],"integer":[51],"linear":[52],"programming":[53],"(MILP)":[54],"formulation":[55],"for":[56,86,94],"problem.":[58],"Moreover,":[59],"design":[61],"simple":[63],"heuristic":[64],"based":[65,79],"on":[66,80],"list":[67],"scheduling":[68],"biased":[71],"random":[72],"key":[73],"genetic":[74],"algorithm":[75],"(BRKGA).":[76],"Computational":[77],"experiments":[78],"instances":[82,93],"from":[83],"literature":[85],"single-fab":[88],"case":[89],"newly":[91],"proposed":[92],"multi-fab":[96],"setting":[97],"conducted.":[99],"results":[101],"demonstrate":[102],"that":[103],"BRKGA":[105],"approach":[106],"able":[108],"determine":[110],"high-quality":[111],"solutions":[112],"short":[115],"amount":[116],"computing":[118],"time.":[119]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}