An exact method for solving the manufacturing cell formation problem
The cell formation problem is extensively studied in the literature, but very few authors have proposed exact methods. In this paper a linear binary programming formulation is introduced to generate a solution for the cell formation problem. To verify the behaviour of the proposed model, a set of 35...
Gespeichert in:
Veröffentlicht in: | International journal of production research 2012-08, Vol.50 (15), p.4038-4045 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 4045 |
---|---|
container_issue | 15 |
container_start_page | 4038 |
container_title | International journal of production research |
container_volume | 50 |
creator | Elbenani, Bouazza Ferland, Jacques A. |
description | The cell formation problem is extensively studied in the literature, but very few authors have proposed exact methods. In this paper a linear binary programming formulation is introduced to generate a solution for the cell formation problem. To verify the behaviour of the proposed model, a set of 35 benchmark problems is solved using the branch and cut method implemented in the IBM ILOG CPLEX 10.11 Optimiser. Moreover, these results allow us to validate the quality of the solution generated with heuristic methods proposed in the literature. This experimentation indicates that, for the smaller problems, the best-known solutions are the same as those generated with CPLEX 10.11 Optimiser. These results indicate a fair confidence in the optimality of the best-known solutions generated by the heuristic methods. Furthermore, our approach is the first exact method providing results of this quality. |
doi_str_mv | 10.1080/00207543.2011.588622 |
format | Article |
fullrecord | <record><control><sourceid>proquest_infor</sourceid><recordid>TN_cdi_proquest_miscellaneous_1283723501</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1283723501</sourcerecordid><originalsourceid>FETCH-LOGICAL-c429t-f5725668526009687bb8b72f1b5c6c0e3a39e65df9ed9bb41e6e6f4f8a072b763</originalsourceid><addsrcrecordid>eNp9kEtLxDAUhYMoOI7-AxcFEdx0zKNJ05UM4xMG3Ci4C2mbOB3SZExadf69qXVcuDCbS-79zr2HA8ApgjMEObyEEMOcZmSGIUIzyjnDeA9MEGEsjb-XfTAZkHRgDsFRCGsYH-XZBFzPbaI-ZdUlrepWrk6080lw5r2xr0m3Ukkrba_jvPdDp1LGDEgru8bZZONdaVR7DA60NEGd_NQpeL69eVrcp8vHu4fFfJlWGS66VNMcU8Y4xQzCgvG8LHmZY41KWrEKKiJJoRitdaHqoiwzpJhiOtNcwhyXOSNTcDHujXffehU60TZhsCStcn0QCHOSY0IhiujZH3Ttem-jO4EggdEBQzxS2UhV3oXglRYb37TSbyMkhmjFLloxRCvGaKPs_Ge5DJU02ktbNeFXixnBhBMSuauRa-x3Zh_Om1p0cmuc34nIv5e-ABVFizA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1030260618</pqid></control><display><type>article</type><title>An exact method for solving the manufacturing cell formation problem</title><source>EBSCOhost Business Source Complete</source><source>Taylor & Francis:Master (3349 titles)</source><creator>Elbenani, Bouazza ; Ferland, Jacques A.</creator><creatorcontrib>Elbenani, Bouazza ; Ferland, Jacques A.</creatorcontrib><description>The cell formation problem is extensively studied in the literature, but very few authors have proposed exact methods. In this paper a linear binary programming formulation is introduced to generate a solution for the cell formation problem. To verify the behaviour of the proposed model, a set of 35 benchmark problems is solved using the branch and cut method implemented in the IBM ILOG CPLEX 10.11 Optimiser. Moreover, these results allow us to validate the quality of the solution generated with heuristic methods proposed in the literature. This experimentation indicates that, for the smaller problems, the best-known solutions are the same as those generated with CPLEX 10.11 Optimiser. These results indicate a fair confidence in the optimality of the best-known solutions generated by the heuristic methods. Furthermore, our approach is the first exact method providing results of this quality.</description><identifier>ISSN: 0020-7543</identifier><identifier>EISSN: 1366-588X</identifier><identifier>DOI: 10.1080/00207543.2011.588622</identifier><identifier>CODEN: IJPRB8</identifier><language>eng</language><publisher>Abingdon: Taylor & Francis Group</publisher><subject>Applied sciences ; Benchmarking ; Branch & bound algorithms ; cell formation problem ; Confidence ; Exact sciences and technology ; Experimentation ; grouping efficiency ; Heuristic ; Heuristic methods ; Inventory control, production control. Distribution ; linear binary programming formulation ; Linear programming ; Manufacturing cells ; Mathematical models ; Mathematical programming ; Operational research and scientific management ; Operational research. Management science ; Optimization ; Optimization techniques ; Programming ; Studies</subject><ispartof>International journal of production research, 2012-08, Vol.50 (15), p.4038-4045</ispartof><rights>Copyright Taylor & Francis Group, LLC 2012</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Taylor & Francis Group 2012</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c429t-f5725668526009687bb8b72f1b5c6c0e3a39e65df9ed9bb41e6e6f4f8a072b763</citedby><cites>FETCH-LOGICAL-c429t-f5725668526009687bb8b72f1b5c6c0e3a39e65df9ed9bb41e6e6f4f8a072b763</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.tandfonline.com/doi/pdf/10.1080/00207543.2011.588622$$EPDF$$P50$$Ginformaworld$$H</linktopdf><linktohtml>$$Uhttps://www.tandfonline.com/doi/full/10.1080/00207543.2011.588622$$EHTML$$P50$$Ginformaworld$$H</linktohtml><link.rule.ids>314,778,782,27907,27908,59628,60417</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=26323833$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Elbenani, Bouazza</creatorcontrib><creatorcontrib>Ferland, Jacques A.</creatorcontrib><title>An exact method for solving the manufacturing cell formation problem</title><title>International journal of production research</title><description>The cell formation problem is extensively studied in the literature, but very few authors have proposed exact methods. In this paper a linear binary programming formulation is introduced to generate a solution for the cell formation problem. To verify the behaviour of the proposed model, a set of 35 benchmark problems is solved using the branch and cut method implemented in the IBM ILOG CPLEX 10.11 Optimiser. Moreover, these results allow us to validate the quality of the solution generated with heuristic methods proposed in the literature. This experimentation indicates that, for the smaller problems, the best-known solutions are the same as those generated with CPLEX 10.11 Optimiser. These results indicate a fair confidence in the optimality of the best-known solutions generated by the heuristic methods. Furthermore, our approach is the first exact method providing results of this quality.</description><subject>Applied sciences</subject><subject>Benchmarking</subject><subject>Branch & bound algorithms</subject><subject>cell formation problem</subject><subject>Confidence</subject><subject>Exact sciences and technology</subject><subject>Experimentation</subject><subject>grouping efficiency</subject><subject>Heuristic</subject><subject>Heuristic methods</subject><subject>Inventory control, production control. Distribution</subject><subject>linear binary programming formulation</subject><subject>Linear programming</subject><subject>Manufacturing cells</subject><subject>Mathematical models</subject><subject>Mathematical programming</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Optimization</subject><subject>Optimization techniques</subject><subject>Programming</subject><subject>Studies</subject><issn>0020-7543</issn><issn>1366-588X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLxDAUhYMoOI7-AxcFEdx0zKNJ05UM4xMG3Ci4C2mbOB3SZExadf69qXVcuDCbS-79zr2HA8ApgjMEObyEEMOcZmSGIUIzyjnDeA9MEGEsjb-XfTAZkHRgDsFRCGsYH-XZBFzPbaI-ZdUlrepWrk6080lw5r2xr0m3Ukkrba_jvPdDp1LGDEgru8bZZONdaVR7DA60NEGd_NQpeL69eVrcp8vHu4fFfJlWGS66VNMcU8Y4xQzCgvG8LHmZY41KWrEKKiJJoRitdaHqoiwzpJhiOtNcwhyXOSNTcDHujXffehU60TZhsCStcn0QCHOSY0IhiujZH3Ttem-jO4EggdEBQzxS2UhV3oXglRYb37TSbyMkhmjFLloxRCvGaKPs_Ge5DJU02ktbNeFXixnBhBMSuauRa-x3Zh_Om1p0cmuc34nIv5e-ABVFizA</recordid><startdate>20120801</startdate><enddate>20120801</enddate><creator>Elbenani, Bouazza</creator><creator>Ferland, Jacques A.</creator><general>Taylor & Francis Group</general><general>Taylor & Francis</general><general>Taylor & Francis LLC</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20120801</creationdate><title>An exact method for solving the manufacturing cell formation problem</title><author>Elbenani, Bouazza ; Ferland, Jacques A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c429t-f5725668526009687bb8b72f1b5c6c0e3a39e65df9ed9bb41e6e6f4f8a072b763</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Applied sciences</topic><topic>Benchmarking</topic><topic>Branch & bound algorithms</topic><topic>cell formation problem</topic><topic>Confidence</topic><topic>Exact sciences and technology</topic><topic>Experimentation</topic><topic>grouping efficiency</topic><topic>Heuristic</topic><topic>Heuristic methods</topic><topic>Inventory control, production control. Distribution</topic><topic>linear binary programming formulation</topic><topic>Linear programming</topic><topic>Manufacturing cells</topic><topic>Mathematical models</topic><topic>Mathematical programming</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Optimization</topic><topic>Optimization techniques</topic><topic>Programming</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Elbenani, Bouazza</creatorcontrib><creatorcontrib>Ferland, Jacques A.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of production research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Elbenani, Bouazza</au><au>Ferland, Jacques A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An exact method for solving the manufacturing cell formation problem</atitle><jtitle>International journal of production research</jtitle><date>2012-08-01</date><risdate>2012</risdate><volume>50</volume><issue>15</issue><spage>4038</spage><epage>4045</epage><pages>4038-4045</pages><issn>0020-7543</issn><eissn>1366-588X</eissn><coden>IJPRB8</coden><abstract>The cell formation problem is extensively studied in the literature, but very few authors have proposed exact methods. In this paper a linear binary programming formulation is introduced to generate a solution for the cell formation problem. To verify the behaviour of the proposed model, a set of 35 benchmark problems is solved using the branch and cut method implemented in the IBM ILOG CPLEX 10.11 Optimiser. Moreover, these results allow us to validate the quality of the solution generated with heuristic methods proposed in the literature. This experimentation indicates that, for the smaller problems, the best-known solutions are the same as those generated with CPLEX 10.11 Optimiser. These results indicate a fair confidence in the optimality of the best-known solutions generated by the heuristic methods. Furthermore, our approach is the first exact method providing results of this quality.</abstract><cop>Abingdon</cop><pub>Taylor & Francis Group</pub><doi>10.1080/00207543.2011.588622</doi><tpages>8</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0020-7543 |
ispartof | International journal of production research, 2012-08, Vol.50 (15), p.4038-4045 |
issn | 0020-7543 1366-588X |
language | eng |
recordid | cdi_proquest_miscellaneous_1283723501 |
source | EBSCOhost Business Source Complete; Taylor & Francis:Master (3349 titles) |
subjects | Applied sciences Benchmarking Branch & bound algorithms cell formation problem Confidence Exact sciences and technology Experimentation grouping efficiency Heuristic Heuristic methods Inventory control, production control. Distribution linear binary programming formulation Linear programming Manufacturing cells Mathematical models Mathematical programming Operational research and scientific management Operational research. Management science Optimization Optimization techniques Programming Studies |
title | An exact method for solving the manufacturing cell formation problem |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T13%3A05%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_infor&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20exact%20method%20for%20solving%20the%20manufacturing%20cell%20formation%20problem&rft.jtitle=International%20journal%20of%20production%20research&rft.au=Elbenani,%20Bouazza&rft.date=2012-08-01&rft.volume=50&rft.issue=15&rft.spage=4038&rft.epage=4045&rft.pages=4038-4045&rft.issn=0020-7543&rft.eissn=1366-588X&rft.coden=IJPRB8&rft_id=info:doi/10.1080/00207543.2011.588622&rft_dat=%3Cproquest_infor%3E1283723501%3C/proquest_infor%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1030260618&rft_id=info:pmid/&rfr_iscdi=true |