{"id":"https://openalex.org/W2910719577","doi":"https://doi.org/10.1109/ieem.2018.8607272","title":"An Integer Linear Programming Approach for the Combined Cell Layout Problem","display_name":"An Integer Linear Programming Approach for the Combined Cell Layout Problem","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2910719577","doi":"https://doi.org/10.1109/ieem.2018.8607272","mag":"2910719577"},"language":"en","primary_location":{"id":"doi:10.1109/ieem.2018.8607272","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem.2018.8607272","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","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/A5005540131","display_name":"Miguel F. Anjos","orcid":"https://orcid.org/0000-0002-8258-9116"},"institutions":[{"id":"https://openalex.org/I4210133247","display_name":"Group for Research in Decision Analysis","ror":"https://ror.org/02pkvpx84","country_code":"CA","type":"facility","lineage":["https://openalex.org/I108192572","https://openalex.org/I159129438","https://openalex.org/I4210133247","https://openalex.org/I45683168","https://openalex.org/I49663120","https://openalex.org/I5023651"]},{"id":"https://openalex.org/I45683168","display_name":"Polytechnique Montr\u00e9al","ror":"https://ror.org/05f8d4e86","country_code":"CA","type":"education","lineage":["https://openalex.org/I45683168"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Miguel F. Anjos","raw_affiliation_strings":["GERAD & Polytechnique Montreal, Montreal, QC, Canada H3C 3A7"],"affiliations":[{"raw_affiliation_string":"GERAD & Polytechnique Montreal, Montreal, QC, Canada H3C 3A7","institution_ids":["https://openalex.org/I45683168","https://openalex.org/I4210133247"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042888689","display_name":"Philipp Hungerl\u00e4nder","orcid":"https://orcid.org/0000-0002-9596-1298"},"institutions":[{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Philipp Hungerlander","raw_affiliation_strings":["Department of Mathematics, Alpen-Adria-Universit\u00e4t Klagenfurt, Klagenfurt, Austria"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Alpen-Adria-Universit\u00e4t Klagenfurt, Klagenfurt, Austria","institution_ids":["https://openalex.org/I4210166741"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084674089","display_name":"Kerstin Maier","orcid":"https://orcid.org/0000-0002-6455-5297"},"institutions":[{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Kerstin Maier","raw_affiliation_strings":["Department of Mathematics, Alpen-Adria-Universit\u00e4t Klagenfurt, Klagenfurt, Austria"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Alpen-Adria-Universit\u00e4t Klagenfurt, Klagenfurt, Austria","institution_ids":["https://openalex.org/I4210166741"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5005540131"],"corresponding_institution_ids":["https://openalex.org/I4210133247","https://openalex.org/I45683168"],"apc_list":null,"apc_paid":null,"fwci":0.7552,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79747756,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"705","last_page":"709"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":1.0,"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":1.0,"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.9966999888420105,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.992900013923645,"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/integer-programming","display_name":"Integer programming","score":0.8465055227279663},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6593710780143738},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.6183555722236633},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5916006565093994},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5887833833694458},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.486817330121994},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48584577441215515},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2954411208629608},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26275649666786194},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14965039491653442}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.8465055227279663},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6593710780143738},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.6183555722236633},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5916006565093994},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5887833833694458},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.486817330121994},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48584577441215515},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2954411208629608},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26275649666786194},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14965039491653442}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ieem.2018.8607272","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem.2018.8607272","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.polymtl.ca:42450","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/42450/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication de conf\u00e9rence"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W146077644","https://openalex.org/W1529167433","https://openalex.org/W1966748173","https://openalex.org/W1983322722","https://openalex.org/W1985680559","https://openalex.org/W1994587583","https://openalex.org/W2002576503","https://openalex.org/W2014136132","https://openalex.org/W2026863487","https://openalex.org/W2060636850","https://openalex.org/W2062143866","https://openalex.org/W2063394514","https://openalex.org/W2064995276","https://openalex.org/W2069379368","https://openalex.org/W2086809861","https://openalex.org/W2089947363","https://openalex.org/W2097536835","https://openalex.org/W2150085518","https://openalex.org/W2158338452","https://openalex.org/W2513195681","https://openalex.org/W2786380269","https://openalex.org/W2913337105","https://openalex.org/W2973510338","https://openalex.org/W6605933553"],"related_works":["https://openalex.org/W2769220156","https://openalex.org/W2009796757","https://openalex.org/W4210880521","https://openalex.org/W4302819359","https://openalex.org/W2941114593","https://openalex.org/W4252122881","https://openalex.org/W2734758384","https://openalex.org/W2941986668","https://openalex.org/W4232431455","https://openalex.org/W3116484972"],"abstract_inverted_index":{"The":[0,41],"Combined":[1],"Cell":[2],"Layout":[3],"Problem":[4],"aims":[5],"to":[6,33,79,84,91],"minimize":[7],"the":[8,27,44],"material":[9],"handling":[10],"costs":[11],"in":[12,26,36,46,88],"a":[13,51,54,69],"cellular":[14],"manufacturing":[15],"system":[16],"with":[17,82],"at":[18],"least":[19],"two":[20],"cells":[21,90],"where":[22],"processing":[23],"occurs,":[24],"and":[25],"presence":[28],"of":[29,43],"pieces":[30],"that":[31,74],"need":[32],"be":[34],"processed":[35],"more":[37],"than":[38],"one":[39,94],"cell.":[40],"alignment":[42],"machines":[45,86],"each":[47],"cell":[48],"can":[49],"follow":[50],"row":[52],"or":[53],"circular":[55],"layout.":[56],"We":[57],"propose":[58],"an":[59],"Integer":[60],"Linear":[61],"Programming":[62],"approach":[63,76],"for":[64],"solving":[65],"this":[66],"problem.":[67],"In":[68],"computational":[70],"study":[71],"we":[72],"show":[73],"our":[75],"is":[77],"able":[78],"solve":[80],"instances":[81],"up":[83],"240":[85],"arranged":[87],"10":[89],"optimality":[92],"within":[93],"minute.":[95]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}