{"id":"https://openalex.org/W4391382192","doi":"https://doi.org/10.1109/wsc60868.2023.10407942","title":"Exact and Heuristic Algorithms for a bi-criteria Order-Lot Pegging Problem in a Multi-Fab Setting","display_name":"Exact and Heuristic Algorithms for a bi-criteria Order-Lot Pegging Problem in a Multi-Fab Setting","publication_year":2023,"publication_date":"2023-12-10","ids":{"openalex":"https://openalex.org/W4391382192","doi":"https://doi.org/10.1109/wsc60868.2023.10407942"},"language":"en","primary_location":{"id":"doi:10.1109/wsc60868.2023.10407942","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/wsc60868.2023.10407942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 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/A5093827948","display_name":"Andreas Haspecker","orcid":null},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"FernUniversit\u00e4t in Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Haspecker","raw_affiliation_strings":["University of Hagen,Department of Mathematics and Computer Science,Hagen,Germany,58097"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hagen,Department of Mathematics and Computer Science,Hagen,Germany,58097","institution_ids":["https://openalex.org/I120691247"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032060363","display_name":"Lars M\u00f6nch","orcid":null},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"FernUniversit\u00e4t in Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Lars M\u00f6nch","raw_affiliation_strings":["University of Hagen,Department of Mathematics and Computer Science,Hagen,Germany,58097"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hagen,Department of Mathematics and Computer Science,Hagen,Germany,58097","institution_ids":["https://openalex.org/I120691247"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I120691247"],"apc_list":null,"apc_paid":null,"fwci":0.1857,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.6194762,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2254","last_page":"2265"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9990000128746033,"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.8234955072402954},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7497103214263916},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7258236408233643},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5695171356201172},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5557736158370972},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5292631387710571},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5238180756568909},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5225731134414673},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5018172264099121},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4870358109474182},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.46736714243888855},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4503622055053711},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4377998113632202},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41003262996673584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32833781838417053},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.28557291626930237},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24565839767456055},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.20918428897857666},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.08079418540000916}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8234955072402954},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7497103214263916},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7258236408233643},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5695171356201172},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5557736158370972},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5292631387710571},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5238180756568909},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5225731134414673},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5018172264099121},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4870358109474182},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.46736714243888855},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4503622055053711},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4377998113632202},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41003262996673584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32833781838417053},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.28557291626930237},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24565839767456055},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.20918428897857666},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.08079418540000916},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/wsc60868.2023.10407942","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/wsc60868.2023.10407942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 Winter Simulation Conference (WSC)","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":23,"referenced_works":["https://openalex.org/W158423294","https://openalex.org/W1498091362","https://openalex.org/W1545722440","https://openalex.org/W1970350858","https://openalex.org/W1970994421","https://openalex.org/W2045911414","https://openalex.org/W2057414700","https://openalex.org/W2073993674","https://openalex.org/W2097366043","https://openalex.org/W2098907614","https://openalex.org/W2120826257","https://openalex.org/W2126105956","https://openalex.org/W2156659802","https://openalex.org/W2168079536","https://openalex.org/W2170909621","https://openalex.org/W2477870999","https://openalex.org/W2487507777","https://openalex.org/W2770860928","https://openalex.org/W3142884250","https://openalex.org/W4236127247","https://openalex.org/W4244244705","https://openalex.org/W4300447457","https://openalex.org/W4301173492"],"related_works":["https://openalex.org/W2011810134","https://openalex.org/W2050497389","https://openalex.org/W1568976062","https://openalex.org/W2960025371","https://openalex.org/W2367625138","https://openalex.org/W2019537266","https://openalex.org/W2012711731","https://openalex.org/W2017891857","https://openalex.org/W4312208395","https://openalex.org/W2147600044"],"abstract_inverted_index":{"We":[0,53,102],"study":[1],"an":[2,71],"order-lot":[3],"pegging":[4],"problem":[5,11,79,93,112,123],"in":[6,34,56],"semiconductor":[7],"supply":[8],"chains.":[9],"The":[10,38],"deals":[12],"with":[13,21,106,115],"assigning":[14],"already":[15],"released":[16],"lots":[17,33],"to":[18,25],"orders":[19,27,47],"and":[20,48,114,121],"planning":[22],"wafer":[23,36],"releases":[24],"fulfill":[26],"if":[28],"there":[29],"are":[30,40,54],"not":[31],"enough":[32],"the":[35,42,46,50,58,107,116],"fabs.":[37],"objectives":[39],"minimizing":[41,49],"total":[43,51],"tardiness":[44],"of":[45,60,99],"cost.":[52],"interested":[55],"computing":[57,100],"set":[59],"Pareto-optimal":[61],"plans.":[62],"Based":[63],"on":[64],"a":[65,82,96],"mixed-integer":[66],"linear":[67],"programming":[68],"(MILP)":[69],"formulation,":[70],"\u03f5-":[72],"constraint":[73],"method":[74,109],"is":[75,88],"proposed":[76],"for":[77,90,110,119],"small-sized":[78,111],"instances.":[80,124],"Moreover,":[81],"non-dominated":[83],"sorting":[84],"genetic":[85],"algorithm":[86],"(NSGA)-II":[87],"designed":[89],"tackling":[91],"larger":[92],"instances":[94,113],"within":[95],"reasonable":[97],"amount":[98],"time.":[101],"perform":[103],"computational":[104],"experiments":[105],"\u03b5-constraint":[108],"NSGA-II":[117],"scheme":[118],"small-":[120],"medium-sized":[122]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}