{"id":"https://openalex.org/W2171492465","doi":"https://doi.org/10.1109/tie.2011.2130498","title":"A Two-Level Genetic Algorithm to Determine Production Frequencies for Economic Lot Scheduling Problem","display_name":"A Two-Level Genetic Algorithm to Determine Production Frequencies for Economic Lot Scheduling Problem","publication_year":2011,"publication_date":"2011-04-06","ids":{"openalex":"https://openalex.org/W2171492465","doi":"https://doi.org/10.1109/tie.2011.2130498","mag":"2171492465"},"language":"en","primary_location":{"id":"doi:10.1109/tie.2011.2130498","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tie.2011.2130498","pdf_url":null,"source":{"id":"https://openalex.org/S58031724","display_name":"IEEE Transactions on Industrial Electronics","issn_l":"0278-0046","issn":["0278-0046","1557-9948"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Industrial Electronics","raw_type":"journal-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":null,"display_name":"Sai Ho Chung","orcid":null},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Sai Ho Chung","raw_affiliation_strings":["Hong Kong Polytechnic University, Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hong Kong Polytechnic University, Hong Kong, China","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024476982","display_name":"Hing Kai Chan","orcid":"https://orcid.org/0000-0002-5534-4076"},"institutions":[{"id":"https://openalex.org/I1118541","display_name":"University of East Anglia","ror":"https://ror.org/026k5mg93","country_code":"GB","type":"education","lineage":["https://openalex.org/I1118541"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hing Kai Chan","raw_affiliation_strings":["Norwich Business School, University of East Anglia, Norwich, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Norwich Business School, University of East Anglia, Norwich, UK","institution_ids":["https://openalex.org/I1118541"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":14.2025,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.98870146,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"59","issue":"1","first_page":"611","last_page":"619"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991999864578247,"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.9991999864578247,"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.9973999857902527,"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.9886999726295471,"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/heuristics","display_name":"Heuristics","score":0.7253448963165283},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6747061610221863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.599788248538971},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5774483680725098},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5612110495567322},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.53400719165802},{"id":"https://openalex.org/keywords/production","display_name":"Production (economics)","score":0.5190204381942749},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4871199131011963},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.468009352684021},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39164429903030396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23575729131698608},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.0844380259513855}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7253448963165283},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6747061610221863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.599788248538971},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5774483680725098},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5612110495567322},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.53400719165802},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.5190204381942749},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4871199131011963},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.468009352684021},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39164429903030396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23575729131698608},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0844380259513855},{"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tie.2011.2130498","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tie.2011.2130498","pdf_url":null,"source":{"id":"https://openalex.org/S58031724","display_name":"IEEE Transactions on Industrial Electronics","issn_l":"0278-0046","issn":["0278-0046","1557-9948"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Industrial Electronics","raw_type":"journal-article"},{"id":"pmh:oai:ueaeprints.uea.ac.uk:36322","is_oa":false,"landing_page_url":"https://ueaeprints.uea.ac.uk/id/eprint/36322/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400384","display_name":"UEA Digital Repository (University of East Anglia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1118541","host_organization_name":"University of East Anglia","host_organization_lineage":["https://openalex.org/I1118541"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W1972133443","https://openalex.org/W1974511941","https://openalex.org/W1975237673","https://openalex.org/W1976987380","https://openalex.org/W1977153580","https://openalex.org/W1983449598","https://openalex.org/W1986221804","https://openalex.org/W1996151756","https://openalex.org/W1999513701","https://openalex.org/W2001305822","https://openalex.org/W2009921115","https://openalex.org/W2025187401","https://openalex.org/W2032491356","https://openalex.org/W2048832546","https://openalex.org/W2049379609","https://openalex.org/W2049907682","https://openalex.org/W2054623195","https://openalex.org/W2055213643","https://openalex.org/W2055693228","https://openalex.org/W2057311554","https://openalex.org/W2060960395","https://openalex.org/W2061448520","https://openalex.org/W2064280655","https://openalex.org/W2073922099","https://openalex.org/W2083279590","https://openalex.org/W2086130014","https://openalex.org/W2087685067","https://openalex.org/W2089838970","https://openalex.org/W2091210562","https://openalex.org/W2092164112","https://openalex.org/W2095050171","https://openalex.org/W2096159335","https://openalex.org/W2100954735","https://openalex.org/W2116362645","https://openalex.org/W2126992812","https://openalex.org/W2128805196","https://openalex.org/W2130056065","https://openalex.org/W2130562829","https://openalex.org/W2132497615","https://openalex.org/W2134454876","https://openalex.org/W2137337501","https://openalex.org/W2145614148","https://openalex.org/W2152814877","https://openalex.org/W2156673398","https://openalex.org/W2159318234","https://openalex.org/W2164998890","https://openalex.org/W2171951665","https://openalex.org/W4242477705","https://openalex.org/W4253572765"],"related_works":["https://openalex.org/W4220780102","https://openalex.org/W2410881844","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W2067280619","https://openalex.org/W2041180560"],"abstract_inverted_index":{"The":[0,48,123],"economic":[1],"lot":[2],"scheduling":[3],"problem":[4,109],"(ELSP)":[5],"has":[6],"been":[7,22],"studied":[8],"over":[9],"50":[10],"years.":[11],"ELSP":[12],"is":[13],"known":[14],"as":[15],"NP-hard":[16],"and":[17,45,106,115,135],"hence":[18],"heuristic":[19],"algorithms":[20],"have":[21],"developed.":[23],"In":[24],"those":[25],"heuristics,":[26],"researchers":[27],"generally":[28],"adopted":[29],"two":[30],"types":[31],"of":[32,39,51,56,81,100,119,140],"rounding-off":[33],"methods":[34],"for":[35,77],"the":[36,42,54,64,78,117,120,127,131,138,141,145],"production":[37,49,68,142],"frequency":[38,50,69,143],"products,":[40],"namely,":[41],"nearest":[43],"integer":[44],"power-of-two":[46],"approaches.":[47],"products":[52],"defines":[53],"number":[55,99],"times":[57],"that":[58,126],"such":[59],"product":[60],"being":[61],"produced":[62],"during":[63],"cycle.":[65],"Therefore,":[66],"different":[67,73],"actually":[70],"leads":[71],"to":[72,93,113,144],"optimization":[74,146],"results":[75],"even":[76],"same":[79],"set":[80],"products.":[82],"For":[83],"this":[84,86,96],"reason,":[85],"paper":[87],"proposes":[88],"a":[89],"two-level":[90],"genetic":[91],"algorithm":[92],"deal":[94],"with":[95],"problem.":[97],"A":[98],"numerical":[101],"examples":[102],"found":[103],"in":[104],"literature":[105],"randomly":[107],"generated":[108],"sets":[110],"are":[111],"used":[112],"test":[114],"benchmark":[116],"performance":[118],"new":[121,128],"approach.":[122],"comparison":[124],"shows":[125],"approach":[129],"outperforms":[130],"other":[132],"existing":[133],"approaches":[134],"also":[136],"demonstrates":[137],"significance":[139],"results.":[147]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}