Assembly line balancing under uncertainty: Robust optimization models and exact solution method
•A robust optimization approach for assembly line balancing is presented.•Mathematical models for interval uncertainty of operation times are suggested.•Decomposition based solution algorithms are developed.•Techniques proposed generate designs that are more protected against disruptions.•Approach p...
Saved in:
| Published in | Computers & industrial engineering Vol. 65; no. 2; pp. 261 - 267 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Elsevier Ltd
01.06.2013
Pergamon Press Inc Elsevier |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | •A robust optimization approach for assembly line balancing is presented.•Mathematical models for interval uncertainty of operation times are suggested.•Decomposition based solution algorithms are developed.•Techniques proposed generate designs that are more protected against disruptions.•Approach proposed can be extended to large class of line balancing problems.
This research deals with line balancing under uncertainty and presents two robust optimization models. Interval uncertainty for operation times was assumed. The methods proposed generate line designs that are protected against this type of disruptions. A decomposition based algorithm was developed and combined with enhancement strategies to solve optimally large scale instances. The efficiency of this algorithm was tested and the experimental results were presented. The theoretical contribution of this paper lies in the novel models proposed and the decomposition based exact algorithm developed. Moreover, it is of practical interest since the production rate of the assembly lines designed with our algorithm will be more reliable as uncertainty is incorporated. Furthermore, this is a pioneering work on robust assembly line balancing and should serve as the basis for a decision support system on this subject. |
|---|---|
| AbstractList | This research deals with line balancing under uncertainty and presents two robust optimization models. Interval uncertainty for operation times was assumed. The methods proposed generate line designs that are protected against this type of disruptions. A decomposition based algorithm was developed and combined with enhancement strategies to solve optimally large scale instances. The efficiency of this algorithm was tested and the experimental results were presented. The theoretical contribution of this paper lies in the novel models proposed and the decomposition based exact algorithm developed. Moreover, it is of practical interest since the production rate of the assembly lines designed with our algorithm will be more reliable as uncertainty is incorporated. Furthermore, this is a pioneering work on robust assembly line balancing and should serve as the basis for a decision support system on this subject. [PUBLICATION ABSTRACT] •A robust optimization approach for assembly line balancing is presented.•Mathematical models for interval uncertainty of operation times are suggested.•Decomposition based solution algorithms are developed.•Techniques proposed generate designs that are more protected against disruptions.•Approach proposed can be extended to large class of line balancing problems. This research deals with line balancing under uncertainty and presents two robust optimization models. Interval uncertainty for operation times was assumed. The methods proposed generate line designs that are protected against this type of disruptions. A decomposition based algorithm was developed and combined with enhancement strategies to solve optimally large scale instances. The efficiency of this algorithm was tested and the experimental results were presented. The theoretical contribution of this paper lies in the novel models proposed and the decomposition based exact algorithm developed. Moreover, it is of practical interest since the production rate of the assembly lines designed with our algorithm will be more reliable as uncertainty is incorporated. Furthermore, this is a pioneering work on robust assembly line balancing and should serve as the basis for a decision support system on this subject. This research deals with line balancing under uncertainty and presents two robust optimization models. Interval uncertainty for operation times was assumed. The methods proposed generate line designs that are protected against this type of disruptions. A decomposition based algorithm was developed and combined with enhancement strategies to solve optimally large scale instances. The efficiency of this algorithm was tested and the experimental results were presented. The theoretical contribution of this paper lies in the novel models proposed and the decomposition based exact algorithm developed. Moreover, it is of practical interest since the production rate of the assembly lines designed with our algorithm will be more reliable as uncertainty is incorporated. Furthermore, this is a pioneering work on robust assembly line balancing and should serve as the basis for a decision support system on this subject. |
| Author | Dolgui, Alexandre Hazır, Öncü |
| Author_xml | – sequence: 1 givenname: Öncü surname: Hazır fullname: Hazır, Öncü email: oncu.hazir@tedu.edu.tr organization: TED Üniversitesi, İktisadi ve İdari Bilimler Fakültesi, Ziya Gökalp Caddesi No.48, 06420 Kolej, Çankaya, Ankara, Turkey – sequence: 2 givenname: Alexandre surname: Dolgui fullname: Dolgui, Alexandre email: dolgui@emse.fr organization: École Nationale Supérieure des Mines, EMSE-FAYOL, CNRS UMR6158, LIMOS, F-42023 Saint-Etienne, France |
| BackLink | https://hal-emse.ccsd.cnrs.fr/emse-00802102$$DView record in HAL |
| BookMark | eNp9kE9rGzEQxUVIII6TD5CboLfCuqPV_m1PJjR1wVAoyVlopdlYZldyJW2o--kjd9NLD4ZhJEa_Nzy9G3JpnUVC7hmsGLDq036lDK5yYHwFqaC4IAvW1G0GZQmXZAG8gqzhZX5NbkLYQyLKli2IWIeAYzcc6WAs0k4O0ipjX-hkNfrUFfoojY3Hz_Sn66YQqTtEM5o_Mhpn6eg0DoFKqyn-lirS4IZpfsG4c_qWXPVyCHj3fi7J8-PXp4dNtv3x7fvDepupIq9iVpeqr3nDZQPAk7e2zlvMKyx0Wcn-dOk6rVXdVHXHoNcqh1Yx1mPbcVl2yJfk47x3Jwdx8GaU_iicNGKz3gocAwqABnIG-StL8IcZPnj3a8IQxd5N3iZ_gvGi4lWTDCSqninlXQgee6FM_Pvr6KUZBANxil7s0xzFKXoBqaBISvaf8p-jc5ovsybFia8GvQgJSfFr41FFoZ05o34DmI6ebA |
| CODEN | CINDDL |
| CitedBy_id | crossref_primary_10_1007_s10845_015_1037_5 crossref_primary_10_1016_j_cie_2015_07_004 crossref_primary_10_1016_j_dam_2022_03_024 crossref_primary_10_1109_ACCESS_2019_2903738 crossref_primary_10_1016_j_ijpe_2013_05_030 crossref_primary_10_1016_j_cie_2021_107346 crossref_primary_10_1016_j_compind_2015_06_003 crossref_primary_10_1016_j_ijpe_2022_108673 crossref_primary_10_1016_j_jmsy_2021_06_004 crossref_primary_10_3182_20140824_6_ZA_1003_00866 crossref_primary_10_1016_j_asoc_2024_111694 crossref_primary_10_1007_s12597_022_00609_w crossref_primary_10_1016_j_jengtecman_2022_101672 crossref_primary_10_1016_j_omega_2015_04_003 crossref_primary_10_1007_s11465_014_0294_x crossref_primary_10_1016_j_omega_2017_08_020 crossref_primary_10_1080_00207543_2015_1129467 crossref_primary_10_1016_j_cie_2019_106048 crossref_primary_10_1016_j_ejor_2019_05_001 crossref_primary_10_1080_00207543_2020_1744765 crossref_primary_10_1080_0305215X_2018_1457656 crossref_primary_10_1007_s10479_023_05809_1 crossref_primary_10_1080_0305215X_2018_1439944 crossref_primary_10_1016_j_rcim_2019_101883 crossref_primary_10_53433_yyufbed_1080238 crossref_primary_10_1080_02522667_2021_1960544 crossref_primary_10_1007_s40436_019_00256_3 crossref_primary_10_1007_s00170_014_5944_y crossref_primary_10_1016_j_ifacol_2022_09_437 crossref_primary_10_1016_j_ejor_2023_08_046 crossref_primary_10_1080_0951192X_2016_1145802 crossref_primary_10_1016_j_jmsy_2019_09_012 crossref_primary_10_1080_00207543_2021_2011464 crossref_primary_10_3182_20130619_3_RU_3018_00644 crossref_primary_10_1016_j_ijpe_2024_109513 crossref_primary_10_1115_1_4055426 crossref_primary_10_1080_00207543_2019_1659520 crossref_primary_10_1016_j_ejor_2016_11_001 crossref_primary_10_1016_j_cie_2015_12_006 crossref_primary_10_14327_iscm_8_74 crossref_primary_10_1016_j_ejor_2021_11_043 crossref_primary_10_1016_j_ejor_2020_12_023 crossref_primary_10_3390_a16020100 crossref_primary_10_1007_s40815_019_00734_7 crossref_primary_10_1016_j_procir_2014_10_015 crossref_primary_10_1016_j_ifacol_2019_11_323 crossref_primary_10_1080_00207543_2021_2002960 crossref_primary_10_1155_2020_2785278 crossref_primary_10_1080_00207543_2021_1881648 crossref_primary_10_1108_EC_01_2021_0061 crossref_primary_10_1080_00207543_2020_1724344 crossref_primary_10_3390_app12020854 crossref_primary_10_3390_appliedmath3030030 crossref_primary_10_1016_j_procir_2018_03_254 crossref_primary_10_1108_AA_03_2018_050 crossref_primary_10_1016_j_cor_2018_01_009 crossref_primary_10_1080_00207543_2016_1223897 crossref_primary_10_1016_j_cie_2019_106182 crossref_primary_10_1016_j_asoc_2023_111025 crossref_primary_10_1016_j_jmsy_2025_01_019 crossref_primary_10_1016_j_cie_2016_01_009 crossref_primary_10_1080_00207543_2016_1213449 crossref_primary_10_1016_j_engappai_2025_110162 crossref_primary_10_1080_17509653_2021_1937366 crossref_primary_10_1007_s10729_020_09528_y crossref_primary_10_1016_j_swevo_2023_101255 crossref_primary_10_1016_j_cie_2020_106540 crossref_primary_10_1016_j_cor_2015_01_010 crossref_primary_10_1080_0951192X_2021_1925967 crossref_primary_10_1016_j_jmsy_2022_05_017 crossref_primary_10_1080_0305215X_2021_1953003 crossref_primary_10_1016_j_ifacol_2015_06_060 crossref_primary_10_1080_01605682_2020_1755897 crossref_primary_10_1016_j_orp_2020_100163 crossref_primary_10_1016_j_procs_2014_09_058 crossref_primary_10_1016_j_cie_2024_110265 crossref_primary_10_1016_j_ijpe_2016_07_016 crossref_primary_10_1016_j_cie_2015_08_018 crossref_primary_10_1016_j_ifacol_2017_08_1215 crossref_primary_10_1016_j_ejor_2015_06_019 crossref_primary_10_1016_j_ejor_2020_08_038 crossref_primary_10_1016_j_jmsy_2025_02_005 crossref_primary_10_3233_JIFS_18520 crossref_primary_10_1016_j_eswa_2023_120737 crossref_primary_10_1080_00207543_2024_2416570 crossref_primary_10_1080_00207543_2018_1427898 crossref_primary_10_1080_00207543_2017_1401747 crossref_primary_10_1080_00207543_2019_1704092 crossref_primary_10_1016_j_ijpe_2021_108272 crossref_primary_10_1080_00207543_2021_1901152 crossref_primary_10_1016_j_jclepro_2017_08_100 crossref_primary_10_1080_00207543_2021_1931978 crossref_primary_10_2139_ssrn_3273566 crossref_primary_10_1016_j_arcontrol_2015_09_001 |
| Cites_doi | 10.1016/S0377-2217(96)00248-2 10.1016/j.ijpe.2007.02.026 10.1016/j.ejor.2003.10.008 10.1016/j.ejor.2004.07.028 10.1002/nav.10043 10.1016/j.ijpe.2012.10.020 10.1016/j.ejor.2004.10.031 10.1016/j.ejor.2008.01.003 10.1057/jors.2012.139 10.1016/j.jmsy.2012.12.005 10.1007/PL00011380 10.1016/j.ejor.2004.07.022 10.1016/0377-2217(95)00047-X 10.1287/opre.29.3.464 10.1016/j.cie.2011.11.005 10.1016/j.cie.2010.08.013 10.1016/j.dam.2012.04.011 10.1016/j.dam.2012.08.037 10.1016/j.cie.2008.11.012 10.1016/j.cor.2009.06.009 10.1016/j.ejor.2006.10.010 10.1016/S0360-8352(96)00277-X 10.1016/j.cie.2011.05.015 10.1080/002075499191003 10.1002/1520-6750(199302)40:1<25::AID-NAV3220400103>3.0.CO;2-2 10.1007/s10107-003-0396-4 10.1016/j.cie.2004.09.001 10.1016/j.cor.2003.11.012 10.1080/00207540412331320526 10.1007/978-1-4757-2620-6 10.1016/j.ejor.2004.09.021 10.1109/ICCIE.2009.5223925 10.1016/j.ijpe.2010.11.018 |
| ContentType | Journal Article |
| Copyright | 2013 Elsevier Ltd Copyright Pergamon Press Inc. Jun 2013 Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2013 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Jun 2013 – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 1XC |
| DOI | 10.1016/j.cie.2013.03.004 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Engineering Computer Science |
| EISSN | 1879-0550 |
| EndPage | 267 |
| ExternalDocumentID | oai_HAL_emse_00802102v1 2955734881 10_1016_j_cie_2013_03_004 S0360835213000934 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKG AABNK AACTN AAEDT AAEDW AAFWJ AAIKC AAIKJ AAKOC AALRI AAMNW AAOAW AAQFI AAQXK AARIN AATTM AAXKI AAXUO ABAOU ABDPE ABJNI ABMAC ABUCO ABWVN ABXDB ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACRPL ADBBV ADEZE ADGUI ADMUD ADNMO ADRHT ADTZH AEBSH AECPX AEIPS AEKER AENEX AFJKZ AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AIEXJ AIGVJ AIKHN AITUG AKRWK ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BKOMP BLXMC BNPGV CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LX9 LY1 LY7 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SDP SDS SES SET SEW SPC SPCBC SSB SSD SSH SST SSW SSZ T5K TAE TN5 WUQ XPP ZMT ~G- AAYWO AAYXX ACVFH ADCNI AEUPX AFPUW AFXIZ AGCQF AGQPQ AGRNS AIGII AIIUN AKBMS AKYEP APXCP CITATION 7SC 8FD EFKBS JQ2 L7M L~C L~D 1XC |
| ID | FETCH-LOGICAL-c426t-75cf7383a80030049729e26e4d56af26e4bbddc7867b10fdc209c11fe9b3a5be3 |
| IEDL.DBID | .~1 |
| ISSN | 0360-8352 |
| IngestDate | Fri May 09 12:28:43 EDT 2025 Fri Jul 25 07:05:33 EDT 2025 Thu Apr 24 23:09:24 EDT 2025 Tue Jul 01 00:40:32 EDT 2025 Sun Apr 06 06:54:00 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Uncertainty Robust optimization Assembly line balancing Combinatorial optimization Exact algorithms Robust Optimization |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c426t-75cf7383a80030049729e26e4d56af26e4bbddc7867b10fdc209c11fe9b3a5be3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| ORCID | 0000-0003-0527-4716 |
| PQID | 1346368497 |
| PQPubID | 9545 |
| PageCount | 7 |
| ParticipantIDs | hal_primary_oai_HAL_emse_00802102v1 proquest_journals_1346368497 crossref_citationtrail_10_1016_j_cie_2013_03_004 crossref_primary_10_1016_j_cie_2013_03_004 elsevier_sciencedirect_doi_10_1016_j_cie_2013_03_004 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2013-06-01 |
| PublicationDateYYYYMMDD | 2013-06-01 |
| PublicationDate_xml | – month: 06 year: 2013 text: 2013-06-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & industrial engineering |
| PublicationYear | 2013 |
| Publisher | Elsevier Ltd Pergamon Press Inc Elsevier |
| Publisher_xml | – name: Elsevier Ltd – name: Pergamon Press Inc – name: Elsevier |
| References | Ben-Tal, Nemirovski (b0015) 2000; 88 Hazir, Erel, Gunalay (b0095) 2011 Costa (b0045) 2005; 32 Kara, Paksoy, Chang (b0105) 2009; 195 Nazarian, Ko (b0130) 2013 Cakir, Altiparmak, Dengiz (b0035) 2011; 60 Scholl (b0140) 1999 Magnanti, Wong (b0120) 1981; 23 Kouvelis, Yu (b0115) 1997 Erel, Sabuncuoglu, Sekerci (b0060) 2005; 43 Guerriero, Miltenburg (b0080) 2003; 50 Klein, Scholl (b0110) 1996; 91 Al-e hashem, S., Aryanezhad, M., Malekly, H., & Sadjadi, S. (2009). Mixed model assembly line balancing problem under uncertainty. In Ozcan, Toklu (b0135) 2009; 57 Hazir, Haouari, Erel (b0100) 2010; 37 Gen, Tsujimura, Li (b0070) 1996; 31 Gurevsky, Battaia, Dolgui (b0085) 2013; 161 Goksen, Agpak (b0075) 2006; 171 Sprecher (b0160) 1999; 37 Boysen, Fliedner, Scholl (b0030) 2008; 111 Erenguc, Tufekci, Zappe (b0065) 1993; 40 Uğurdağ, Rachamadugu, Papachristou (b0165) 1997; 102 (pp. 233 –238). Dolgui, Kovalev (b0055) 2012; 160 Montemanni, Gambardella (b0125) 2005; 161 Bertsimas, Sim (b0020) 2003; 98 Gurevsky, Hazir, Battaı¨a, Dolgui (b0090) 2012 Sotskov, Dolgui, Portmann (b0155) 2006; 168 Chiang, Urban (b0040) 2006; 175 Scholl, Becker (b0145) 2006; 168 Simaria, Vilarinho (b0150) 2004; 47 Wei, Chao (b0170) 2011; 61 Dolgui, Guschinsky, Levin (b0050) 2012; 62 Battaia, Dolgui (b0010) 2013; 142 Boysen, Fliedner, Scholl (b0025) 2007; 183 Kara (10.1016/j.cie.2013.03.004_b0105) 2009; 195 Scholl (10.1016/j.cie.2013.03.004_b0145) 2006; 168 Gen (10.1016/j.cie.2013.03.004_b0070) 1996; 31 Cakir (10.1016/j.cie.2013.03.004_b0035) 2011; 60 Montemanni (10.1016/j.cie.2013.03.004_b0125) 2005; 161 Dolgui (10.1016/j.cie.2013.03.004_b0055) 2012; 160 Sprecher (10.1016/j.cie.2013.03.004_b0160) 1999; 37 Costa (10.1016/j.cie.2013.03.004_b0045) 2005; 32 Gurevsky (10.1016/j.cie.2013.03.004_b0085) 2013; 161 Scholl (10.1016/j.cie.2013.03.004_b0140) 1999 Battaia (10.1016/j.cie.2013.03.004_b0010) 2013; 142 Hazir (10.1016/j.cie.2013.03.004_b0095) 2011 Ben-Tal (10.1016/j.cie.2013.03.004_b0015) 2000; 88 Boysen (10.1016/j.cie.2013.03.004_b0025) 2007; 183 Goksen (10.1016/j.cie.2013.03.004_b0075) 2006; 171 Uğurdağ (10.1016/j.cie.2013.03.004_b0165) 1997; 102 Wei (10.1016/j.cie.2013.03.004_b0170) 2011; 61 Sotskov (10.1016/j.cie.2013.03.004_b0155) 2006; 168 Erel (10.1016/j.cie.2013.03.004_b0060) 2005; 43 Dolgui (10.1016/j.cie.2013.03.004_b0050) 2012; 62 Hazir (10.1016/j.cie.2013.03.004_b0100) 2010; 37 Nazarian (10.1016/j.cie.2013.03.004_b0130) 2013 10.1016/j.cie.2013.03.004_b0005 Ozcan (10.1016/j.cie.2013.03.004_b0135) 2009; 57 Chiang (10.1016/j.cie.2013.03.004_b0040) 2006; 175 Guerriero (10.1016/j.cie.2013.03.004_b0080) 2003; 50 Kouvelis (10.1016/j.cie.2013.03.004_b0115) 1997 Gurevsky (10.1016/j.cie.2013.03.004_b0090) 2012 Magnanti (10.1016/j.cie.2013.03.004_b0120) 1981; 23 Simaria (10.1016/j.cie.2013.03.004_b0150) 2004; 47 Erenguc (10.1016/j.cie.2013.03.004_b0065) 1993; 40 Bertsimas (10.1016/j.cie.2013.03.004_b0020) 2003; 98 Klein (10.1016/j.cie.2013.03.004_b0110) 1996; 91 Boysen (10.1016/j.cie.2013.03.004_b0030) 2008; 111 |
| References_xml | – volume: 88 start-page: 411 year: 2000 end-page: 424 ident: b0015 article-title: Robust solutions of linear programming problems contaminated with uncertain data publication-title: Mathematical Programming – volume: 31 start-page: 631 year: 1996 end-page: 634 ident: b0070 article-title: Fuzzy assembly line balancing using genetic algorithms publication-title: Computers & Industrial Engineering – volume: 161 start-page: 377 year: 2013 end-page: 394 ident: b0085 article-title: Stability measure for a generalized assembly line balancing problem publication-title: Discrete Applied Mathematics – reference: Al-e hashem, S., Aryanezhad, M., Malekly, H., & Sadjadi, S. (2009). Mixed model assembly line balancing problem under uncertainty. In – volume: 40 start-page: 25 year: 1993 end-page: 50 ident: b0065 article-title: Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition publication-title: Naval Research Logistics – volume: 98 start-page: 49 year: 2003 end-page: 71 ident: b0020 article-title: Robust discrete optimization and network flows publication-title: Mathematical Programming – year: 2012 ident: b0090 article-title: Robust balancing of straight assembly lines with interval task times publication-title: Journal of the Operational Research Society – volume: 183 start-page: 674 year: 2007 end-page: 693 ident: b0025 article-title: A classification of assembly line balancing problems publication-title: European Journal of Operational Research – volume: 32 start-page: 1429 year: 2005 end-page: 1450 ident: b0045 article-title: A survey on benders decomposition applied to fixed-charge network design problems publication-title: Computers & Operations Research – year: 1997 ident: b0115 article-title: Robust discrete optimization and its applications (nonconvex optimization and its applications) – volume: 37 start-page: 1787 year: 1999 end-page: 1816 ident: b0160 article-title: A competitive branch-and-bound algorithm for the simple assembly line balancing problem publication-title: International Journal of Production Research – volume: 23 start-page: 464 year: 1981 end-page: 484 ident: b0120 article-title: Accelerating benders decomposition: Algorithmic enhancement and model selection criteria publication-title: Operations Research – volume: 161 start-page: 771 year: 2005 end-page: 779 ident: b0125 article-title: A branch and bound algorithm for the robust spanning tree problem with interval data publication-title: European Journal of Operational Research – volume: 102 start-page: 488 year: 1997 end-page: 501 ident: b0165 article-title: Designing paced assembly lines with fixed number of stations publication-title: European Journal of Operational Research – volume: 43 start-page: 1411 year: 2005 end-page: 1426 ident: b0060 article-title: Stochastic assembly line balancing using beam search publication-title: International Journal of Production Research – volume: 37 start-page: 649 year: 2010 end-page: 655 ident: b0100 article-title: Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version publication-title: Computers and Operations Research – reference: (pp. 233 –238). – volume: 175 start-page: 1767 year: 2006 end-page: 1781 ident: b0040 article-title: The stochastic U-line balancing problem: A heuristic procedure publication-title: European Journal of Operational Research – volume: 142 start-page: 259 year: 2013 end-page: 277 ident: b0010 article-title: A taxonomy of line balancing problems and their solution approaches publication-title: International Journal of Production Economics – volume: 57 start-page: 217 year: 2009 end-page: 227 ident: b0135 article-title: Balancing of mixed-model two-sided assembly lines publication-title: Computers & Industrial Engineering – year: 2013 ident: b0130 article-title: Robust manufacturing line design with controlled moderate robustness in bottleneck buffer time to manage stochastic inter-task times publication-title: Journal of Manufacturing Systems – volume: 61 start-page: 824 year: 2011 end-page: 830 ident: b0170 article-title: A solution procedure for type e simple assembly line balancing problem publication-title: Computers & Industrial Engineering – volume: 195 start-page: 335 year: 2009 end-page: 347 ident: b0105 article-title: Binary fuzzy goal programming approach to single model straight and u-shaped assembly line balancing publication-title: European Journal of Operational Research – volume: 50 start-page: 31 year: 2003 end-page: 57 ident: b0080 article-title: The stochastic U-line balancing problem publication-title: Naval Research Logistics – volume: 111 start-page: 509 year: 2008 end-page: 528 ident: b0030 article-title: Assembly line balancing: Which model to use when? publication-title: International Journal of Production Economics – year: 1999 ident: b0140 article-title: Balancing and sequencing of assembly lines – volume: 160 start-page: 1955 year: 2012 end-page: 1963 ident: b0055 article-title: Scenario based robust line balancing: Computational complexity publication-title: Discrete Applied Mathematics – volume: 60 start-page: 376 year: 2011 end-page: 384 ident: b0035 article-title: Multi-objective optimization of a stochastic assembly line balancing: A hybrid simulated annealing algorithm publication-title: Computers & Industrial Engineering – volume: 62 start-page: 570 year: 2012 end-page: 578 ident: b0050 article-title: Enhanced mixed integer programming model for a transfer line design problem publication-title: Computers & Industrial Engineering – volume: 47 start-page: 391 year: 2004 end-page: 407 ident: b0150 article-title: A genetic algorithm based approach to the mixed-model assembly line balancing problem of type II publication-title: Computers & Industrial Engineering – volume: 171 start-page: 577 year: 2006 end-page: 585 ident: b0075 article-title: A goal programming approach to simple U-line balancing problem publication-title: European Journal of Operational Research – start-page: 87 year: 2011 end-page: 95 ident: b0095 article-title: Robust optimization models for the discrete time/cost trade-off problem publication-title: International Journal of Production Economics – volume: 168 start-page: 783 year: 2006 end-page: 797 ident: b0155 article-title: Stability analysis of an optimal balance for an assembly line with fixed cycle time publication-title: European Journal of Operational Research – volume: 91 start-page: 367 year: 1996 end-page: 385 ident: b0110 article-title: Maximizing the production rate in simple assembly line balancing – a branch and bound procedure publication-title: European Journal of Operational Research – volume: 168 start-page: 666 year: 2006 end-page: 693 ident: b0145 article-title: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing publication-title: European Journal of Operational Research – volume: 102 start-page: 488 issue: 3 year: 1997 ident: 10.1016/j.cie.2013.03.004_b0165 article-title: Designing paced assembly lines with fixed number of stations publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(96)00248-2 – volume: 111 start-page: 509 issue: 2 year: 2008 ident: 10.1016/j.cie.2013.03.004_b0030 article-title: Assembly line balancing: Which model to use when? publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2007.02.026 – volume: 161 start-page: 771 issue: 3 year: 2005 ident: 10.1016/j.cie.2013.03.004_b0125 article-title: A branch and bound algorithm for the robust spanning tree problem with interval data publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2003.10.008 – volume: 168 start-page: 783 issue: 3 year: 2006 ident: 10.1016/j.cie.2013.03.004_b0155 article-title: Stability analysis of an optimal balance for an assembly line with fixed cycle time publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.028 – volume: 50 start-page: 31 issue: 1 year: 2003 ident: 10.1016/j.cie.2013.03.004_b0080 article-title: The stochastic U-line balancing problem publication-title: Naval Research Logistics doi: 10.1002/nav.10043 – volume: 142 start-page: 259 issue: 2 year: 2013 ident: 10.1016/j.cie.2013.03.004_b0010 article-title: A taxonomy of line balancing problems and their solution approaches publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2012.10.020 – volume: 175 start-page: 1767 issue: 3 year: 2006 ident: 10.1016/j.cie.2013.03.004_b0040 article-title: The stochastic U-line balancing problem: A heuristic procedure publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.10.031 – volume: 195 start-page: 335 issue: 2 year: 2009 ident: 10.1016/j.cie.2013.03.004_b0105 article-title: Binary fuzzy goal programming approach to single model straight and u-shaped assembly line balancing publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.01.003 – year: 2012 ident: 10.1016/j.cie.2013.03.004_b0090 article-title: Robust balancing of straight assembly lines with interval task times publication-title: Journal of the Operational Research Society doi: 10.1057/jors.2012.139 – year: 2013 ident: 10.1016/j.cie.2013.03.004_b0130 article-title: Robust manufacturing line design with controlled moderate robustness in bottleneck buffer time to manage stochastic inter-task times publication-title: Journal of Manufacturing Systems doi: 10.1016/j.jmsy.2012.12.005 – volume: 88 start-page: 411 year: 2000 ident: 10.1016/j.cie.2013.03.004_b0015 article-title: Robust solutions of linear programming problems contaminated with uncertain data publication-title: Mathematical Programming doi: 10.1007/PL00011380 – volume: 168 start-page: 666 issue: 3 year: 2006 ident: 10.1016/j.cie.2013.03.004_b0145 article-title: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.022 – volume: 91 start-page: 367 issue: 2 year: 1996 ident: 10.1016/j.cie.2013.03.004_b0110 article-title: Maximizing the production rate in simple assembly line balancing – a branch and bound procedure publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00047-X – volume: 23 start-page: 464 year: 1981 ident: 10.1016/j.cie.2013.03.004_b0120 article-title: Accelerating benders decomposition: Algorithmic enhancement and model selection criteria publication-title: Operations Research doi: 10.1287/opre.29.3.464 – volume: 62 start-page: 570 issue: 2 year: 2012 ident: 10.1016/j.cie.2013.03.004_b0050 article-title: Enhanced mixed integer programming model for a transfer line design problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2011.11.005 – volume: 60 start-page: 376 issue: 3 year: 2011 ident: 10.1016/j.cie.2013.03.004_b0035 article-title: Multi-objective optimization of a stochastic assembly line balancing: A hybrid simulated annealing algorithm publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2010.08.013 – volume: 160 start-page: 1955 issue: 13–14 year: 2012 ident: 10.1016/j.cie.2013.03.004_b0055 article-title: Scenario based robust line balancing: Computational complexity publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2012.04.011 – volume: 161 start-page: 377 issue: 3 year: 2013 ident: 10.1016/j.cie.2013.03.004_b0085 article-title: Stability measure for a generalized assembly line balancing problem publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2012.08.037 – volume: 57 start-page: 217 issue: 1 year: 2009 ident: 10.1016/j.cie.2013.03.004_b0135 article-title: Balancing of mixed-model two-sided assembly lines publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2008.11.012 – year: 1999 ident: 10.1016/j.cie.2013.03.004_b0140 – volume: 37 start-page: 649 issue: 4 year: 2010 ident: 10.1016/j.cie.2013.03.004_b0100 article-title: Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version publication-title: Computers and Operations Research doi: 10.1016/j.cor.2009.06.009 – volume: 183 start-page: 674 issue: 2 year: 2007 ident: 10.1016/j.cie.2013.03.004_b0025 article-title: A classification of assembly line balancing problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.10.010 – volume: 31 start-page: 631 issue: 34 year: 1996 ident: 10.1016/j.cie.2013.03.004_b0070 article-title: Fuzzy assembly line balancing using genetic algorithms publication-title: Computers & Industrial Engineering doi: 10.1016/S0360-8352(96)00277-X – volume: 61 start-page: 824 issue: 3 year: 2011 ident: 10.1016/j.cie.2013.03.004_b0170 article-title: A solution procedure for type e simple assembly line balancing problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2011.05.015 – volume: 37 start-page: 1787 issue: 8 year: 1999 ident: 10.1016/j.cie.2013.03.004_b0160 article-title: A competitive branch-and-bound algorithm for the simple assembly line balancing problem publication-title: International Journal of Production Research doi: 10.1080/002075499191003 – volume: 40 start-page: 25 issue: 1 year: 1993 ident: 10.1016/j.cie.2013.03.004_b0065 article-title: Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition publication-title: Naval Research Logistics doi: 10.1002/1520-6750(199302)40:1<25::AID-NAV3220400103>3.0.CO;2-2 – volume: 98 start-page: 49 year: 2003 ident: 10.1016/j.cie.2013.03.004_b0020 article-title: Robust discrete optimization and network flows publication-title: Mathematical Programming doi: 10.1007/s10107-003-0396-4 – volume: 47 start-page: 391 issue: 4 year: 2004 ident: 10.1016/j.cie.2013.03.004_b0150 article-title: A genetic algorithm based approach to the mixed-model assembly line balancing problem of type II publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2004.09.001 – volume: 32 start-page: 1429 issue: 6 year: 2005 ident: 10.1016/j.cie.2013.03.004_b0045 article-title: A survey on benders decomposition applied to fixed-charge network design problems publication-title: Computers & Operations Research doi: 10.1016/j.cor.2003.11.012 – volume: 43 start-page: 1411 issue: 7 year: 2005 ident: 10.1016/j.cie.2013.03.004_b0060 article-title: Stochastic assembly line balancing using beam search publication-title: International Journal of Production Research doi: 10.1080/00207540412331320526 – year: 1997 ident: 10.1016/j.cie.2013.03.004_b0115 doi: 10.1007/978-1-4757-2620-6 – volume: 171 start-page: 577 issue: 2 year: 2006 ident: 10.1016/j.cie.2013.03.004_b0075 article-title: A goal programming approach to simple U-line balancing problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.09.021 – ident: 10.1016/j.cie.2013.03.004_b0005 doi: 10.1109/ICCIE.2009.5223925 – start-page: 87 issue: 1 year: 2011 ident: 10.1016/j.cie.2013.03.004_b0095 article-title: Robust optimization models for the discrete time/cost trade-off problem publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2010.11.018 |
| SSID | ssj0004591 |
| Score | 2.3909948 |
| Snippet | •A robust optimization approach for assembly line balancing is presented.•Mathematical models for interval uncertainty of operation times are... This research deals with line balancing under uncertainty and presents two robust optimization models. Interval uncertainty for operation times was assumed.... |
| SourceID | hal proquest crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 261 |
| SubjectTerms | Algorithms Assembly line balancing Assembly lines Combinatorial optimization Computer Science Decision support systems Exact algorithms Mathematical models Mathematical problems Modeling and Simulation Optimization algorithms Robust optimization Studies Uncertainty |
| Title | Assembly line balancing under uncertainty: Robust optimization models and exact solution method |
| URI | https://dx.doi.org/10.1016/j.cie.2013.03.004 https://www.proquest.com/docview/1346368497 https://hal-emse.ccsd.cnrs.fr/emse-00802102 |
| Volume | 65 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9wwEB5ReqGHllIQWx6yBCeksPHGeXFbrUDb8jhAkbhZGdsRIHYXkYDgwm_vTOKgbaVyqBRFkeM4kWc88zkefwOwqziDtSxcgDH_urE2CQqbYVBKzJSUOWLD3Xl6lowv1c-r-GoBRt1eGA6r9La_temNtfYlfd-b_fubm_4F2d4GP_CCDM3LmRNUqZS1fP9VzjGGt1nzqHLAtbuVzSbGi5rl6K6o5TlV__JNH645SPIvW904oKNl-OyRoxi2H_cVFtx0Bb54FCn8GK1W4NMcxeA30LyqO8G7F8F4UiBHMhq6I3jz2AOdTRsTUL8ciPMZPla1mJEVmfjtmaLJlFOJYmqFey5MLTpdFW3u6VW4PDr8NRoHPqlCYMgZ10EamzKlaWmR8fim-QGhazdInLJxUpR8gWitSbMkRRmW1gzC3EhZuhyjIkYXrcHidDZ16yBcFtoos3lR5mRv0WQKI5fGg8QSKkBlexB23amNZxznxBd3ugstu6Vyp1kCOqQjVD3Ye3vkvqXbeK-y6mSk_9AZTe7gvcd2SJ5vzTO_9nh4ot2kcrrZekyY60n2YLOTt_bDutIyYn61jDrt-_-9ewOWBm0-jSCUm7BYPzy6LUI1NW43arsNH4c_jsdnvwEoLvWX |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PT9VAEJ4AHtQDKEp8iLqJejGpr9tuf5F4ICp5yIODQsJt7exuI4b3HqFFfRf-Kf5BZ9otQRM5mJA0TdN2t-3M7jffdmdnAF4pzmAtSxdgwr9urE2D0uYYVBJzJWWB2Mbu3NtPR4fq01FytACX_VoYdqv02N9heovW_szQS3N4enw8_ELY2_IHnpChcbnynpW7bv6Txm31u50PpOTXUbT98eD9KPCpBQJDJqkJssRUGQ3OypxbObFk4pguSp2ySVpWfIBorcnyNEMZVtZEYWGkrFyBcZmgi6neRbijCC44bcLbC3ktRHmXpo_eLuDX66dSW6cy-g52J4u7wKrqX8Zw8Rt7Zf5lHFqLt_0Alj1VFVudNB7CgpuuwoqnrcKDQr0K96_FNHwEmqeRJ3gyF0xgBbLrpKErglerndHedE4IzXxTfJ7hed2IGcHWxK8HFW1qnlqUUyvcr9I0ou8cokt2_RgOb0XUa7A0nU3dExAuD22c26KsCgJ4NLnC2GVJlFqiIajsAMJenNr4EOecaeNE975s3-m806wBHdIWqgG8uSpy2sX3uOlm1etI_9FINdmfm4q9JH1eVc8BvUdbY-0mtdPtWmcieT_kADZ6fWuPI7WWMQd0y0lo6__37Bdwd3SwN9bjnf3dp3Av6pJ5BKHcgKXm7Nw9I0rV4PO2CQv4ett95jdbnDFo |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Assembly+line+balancing+under+uncertainty%3A+Robust+optimization+models+and+exact+solution+method&rft.jtitle=Computers+%26+industrial+engineering&rft.au=Hazir%2C+%C3%96nc%C3%BC&rft.au=Dolgui%2C+Alexandre&rft.date=2013-06-01&rft.pub=Pergamon+Press+Inc&rft.issn=0360-8352&rft.eissn=1879-0550&rft.volume=65&rft.issue=2&rft.spage=261&rft_id=info:doi/10.1016%2Fj.cie.2013.03.004&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2955734881 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0360-8352&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0360-8352&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0360-8352&client=summon |