{"id":"https://openalex.org/W2588992289","doi":"https://doi.org/10.1109/tase.2017.2654423","title":"Safety-Level Aware Bin-Packing Heuristic for Automatic Assignment of Power Plants Control Functions","display_name":"Safety-Level Aware Bin-Packing Heuristic for Automatic Assignment of Power Plants Control Functions","publication_year":2017,"publication_date":"2017-02-14","ids":{"openalex":"https://openalex.org/W2588992289","doi":"https://doi.org/10.1109/tase.2017.2654423","mag":"2588992289"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2017.2654423","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2017.2654423","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"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 Automation Science and Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-01472162","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091648207","display_name":"Mohamed Benazouz","orcid":"https://orcid.org/0000-0002-5229-785X"},"institutions":[{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4387153626","display_name":"Laboratoire Universitaire de Recherche en Production Automatis\u00e9e","ror":"https://ror.org/05wjc8a85","country_code":null,"type":"facility","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4387153626"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mohamed Benazouz","raw_affiliation_strings":["\u00c9cole normale sup\u00e9rieure Paris-Saclay, Laboratoire universitaire de recherche en production automatis\u00e9e, Cachan, France","LURPA - Laboratoire Universitaire de Recherche en Production Automatis\u00e9e (61, avenue du Pr\u00e9sident-Wilson 94235 CACHAN Cedex - France)"],"raw_orcid":"https://orcid.org/0000-0002-5229-785X","affiliations":[{"raw_affiliation_string":"\u00c9cole normale sup\u00e9rieure Paris-Saclay, Laboratoire universitaire de recherche en production automatis\u00e9e, Cachan, France","institution_ids":["https://openalex.org/I11559806","https://openalex.org/I4387153626"]},{"raw_affiliation_string":"LURPA - Laboratoire Universitaire de Recherche en Production Automatis\u00e9e (61, avenue du Pr\u00e9sident-Wilson 94235 CACHAN Cedex - France)","institution_ids":["https://openalex.org/I4387153626"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112465680","display_name":"Jean-Marc Faure","orcid":null},"institutions":[{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4387153626","display_name":"Laboratoire Universitaire de Recherche en Production Automatis\u00e9e","ror":"https://ror.org/05wjc8a85","country_code":null,"type":"facility","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4387153626"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Marc Faure","raw_affiliation_strings":["\u00c9cole normale sup\u00e9rieure Paris-Saclay, Laboratoire universitaire de recherche en production automatis\u00e9e, Cachan, France","LURPA - Laboratoire Universitaire de Recherche en Production Automatis\u00e9e (61, avenue du Pr\u00e9sident-Wilson 94235 CACHAN Cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole normale sup\u00e9rieure Paris-Saclay, Laboratoire universitaire de recherche en production automatis\u00e9e, Cachan, France","institution_ids":["https://openalex.org/I11559806","https://openalex.org/I4387153626"]},{"raw_affiliation_string":"LURPA - Laboratoire Universitaire de Recherche en Production Automatis\u00e9e (61, avenue du Pr\u00e9sident-Wilson 94235 CACHAN Cedex - France)","institution_ids":["https://openalex.org/I4387153626"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5937,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71919192,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"15","issue":"2","first_page":"602","last_page":"612"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9983000159263611,"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.9983000159263611,"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.9965999722480774,"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.9955999851226807,"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/bin-packing-problem","display_name":"Bin packing problem","score":0.6940267086029053},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6913669109344482},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6481075286865234},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5440037846565247},{"id":"https://openalex.org/keywords/automation","display_name":"Automation","score":0.5416858792304993},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.517997145652771},{"id":"https://openalex.org/keywords/weapon-target-assignment-problem","display_name":"Weapon target assignment problem","score":0.517574667930603},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5080900192260742},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5002775192260742},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.47007399797439575},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4548947215080261},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4484439492225647},{"id":"https://openalex.org/keywords/combinatorial-explosion","display_name":"Combinatorial explosion","score":0.4287444055080414},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.42049479484558105},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4106593430042267},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4088561236858368},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.40717917680740356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3177042603492737},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3070736527442932},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.18712353706359863}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.6940267086029053},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6913669109344482},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6481075286865234},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5440037846565247},{"id":"https://openalex.org/C115901376","wikidata":"https://www.wikidata.org/wiki/Q184199","display_name":"Automation","level":2,"score":0.5416858792304993},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.517997145652771},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.517574667930603},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5080900192260742},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5002775192260742},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.47007399797439575},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4548947215080261},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4484439492225647},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.4287444055080414},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.42049479484558105},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4106593430042267},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4088561236858368},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.40717917680740356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3177042603492737},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3070736527442932},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.18712353706359863},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tase.2017.2654423","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2017.2654423","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"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 Automation Science and Engineering","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01472162v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01472162","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Automation Science and Engineering, 2017, pp.1 - 11. ⟨10.1109/TASE.2017.2654423⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01472162v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01472162","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Automation Science and Engineering, 2017, pp.1 - 11. ⟨10.1109/TASE.2017.2654423⟩","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1518183515","https://openalex.org/W1557310162","https://openalex.org/W1889744809","https://openalex.org/W1990313671","https://openalex.org/W2000840218","https://openalex.org/W2001973270","https://openalex.org/W2002284890","https://openalex.org/W2011039300","https://openalex.org/W2011521967","https://openalex.org/W2018919141","https://openalex.org/W2048947076","https://openalex.org/W2054718728","https://openalex.org/W2066671865","https://openalex.org/W2077470163","https://openalex.org/W2106533473","https://openalex.org/W2113889567","https://openalex.org/W2153584512","https://openalex.org/W2470835488","https://openalex.org/W2800347522","https://openalex.org/W2963964677","https://openalex.org/W3134267570","https://openalex.org/W3143520087","https://openalex.org/W3145128584","https://openalex.org/W4210431029","https://openalex.org/W4246219036","https://openalex.org/W4295070211","https://openalex.org/W6720433847"],"related_works":["https://openalex.org/W2937059810","https://openalex.org/W2358965113","https://openalex.org/W2760584304","https://openalex.org/W2113934189","https://openalex.org/W2379349345","https://openalex.org/W2382974548","https://openalex.org/W2135219659","https://openalex.org/W1586515950","https://openalex.org/W2311097448","https://openalex.org/W2150515595"],"abstract_inverted_index":{"Finding":[0],"a":[1,8,25,37,42,61,77,86,98,135,140],"suitable":[2],"set":[3,10],"of":[4,11,31,36,88,91,121,171],"controllers":[5],"to":[6,102,109,146,153,190],"which":[7,55],"large":[9],"control":[12,34],"functions":[13,156],"with":[14,83],"different":[15,89],"safety":[16],"levels":[17],"can":[18,73],"be":[19,74,103],"assigned,":[20],"while":[21],"minimizing":[22],"cost,":[23],"is":[24,47,60,100,198],"significant":[26],"task":[27,46],"during":[28],"the":[29,32,69,92,122,155,169,178,192,195],"design":[30],"operational":[33],"system":[35],"critical":[38],"process,":[39],"such":[40],"as":[41,76],"power":[43],"plant.":[44],"This":[45,64],"currently":[48],"performed":[49],"by":[50],"experts":[51],"and":[52,106,150,163,183],"extremely":[53],"time-consuming,":[54],"explains":[56],"why":[57],"its":[58],"automation":[59],"real":[62],"concern.":[63],"paper":[65,133],"shows":[66],"first":[67],"that":[68,177,186],"above-mentioned":[70],"assignment":[71,158],"problem":[72,99,128],"identified":[75],"multiple-choice":[78],"vector":[79],"bin":[80],"packing":[81],"(BP)":[82],"conflicts":[84],"problem,":[85],"combination":[87],"variants":[90],"well-known":[93],"1-D":[94],"BP":[95],"problem.":[96],"Such":[97],"known":[101],"strongly":[104],"NP-hard":[105],"exact":[107],"techniques":[108],"solve":[110,126],"it":[111],"on":[112,139,168],"large-sized":[113],"examples":[114],"are":[115,159,165,187],"too":[116],"time":[117],"and/or":[118],"space-consuming":[119],"because":[120],"combinatorial":[123],"explosion.":[124],"To":[125],"this":[127,132,148],"in":[129,194],"polynomial":[130],"time,":[131],"proposes":[134],"fast":[136],"heuristic":[137,149,180],"based":[138],"first-fit":[141],"decreasing":[142],"approach.":[143],"Two":[144],"strategies":[145,162],"perform":[147],"several":[151],"criteria":[152,164],"rank":[154],"before":[157],"defined.":[160],"These":[161,174],"then":[166],"compared":[167],"basis":[170],"numerous":[172],"experiments.":[173],"experiments":[175],"show":[176],"proposed":[179],"scales":[181],"well":[182],"provides":[184],"results":[185],"very":[188],"close":[189],"optimum;":[191],"difference":[193],"worst":[196],"case":[197],"less":[199],"than":[200],"1%.":[201]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2019,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}