Risk-averse two-stage stochastic programming for assembly line reconfiguration with dynamic lot sizes
In this paper, a comprehensive optimization problem is developed for a composite of an assembly line reconfiguration problem with multiple lines and a capacitated lot-sizing problem. Multiple products are considered, whose demand is uncertain and is dynamically forecasted. The production planner is...
Uložené v:
| Vydané v: | Omega (Oxford) Ročník 127; s. 103092 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Ltd
01.09.2024
|
| Predmet: | |
| ISSN: | 0305-0483, 1873-5274 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In this paper, a comprehensive optimization problem is developed for a composite of an assembly line reconfiguration problem with multiple lines and a capacitated lot-sizing problem. Multiple products are considered, whose demand is uncertain and is dynamically forecasted. The production planner is assumed to be risk-averse, and decisions are made contingent upon the risk preference. To model the problem, a stochastic program with two stages is utilized. A solution approach is devised using a divide-and-conquer algorithm, which incorporates a set of valid inequalities. The effectiveness and efficiency of the proposed solution approach are assessed through a series of computational tests. Finally, a case study focusing on an engine production process is presented, leading to the derivation of several valuable insights.
•A joint optimization problem that combines assembly line rebalancing and lot sizing problems.•Stochastic two-stage models are proposed.•Divide-and-conquer algorithm and valid inequalities are utilized. |
|---|---|
| AbstractList | In this paper, a comprehensive optimization problem is developed for a composite of an assembly line reconfiguration problem with multiple lines and a capacitated lot-sizing problem. Multiple products are considered, whose demand is uncertain and is dynamically forecasted. The production planner is assumed to be risk-averse, and decisions are made contingent upon the risk preference. To model the problem, a stochastic program with two stages is utilized. A solution approach is devised using a divide-and-conquer algorithm, which incorporates a set of valid inequalities. The effectiveness and efficiency of the proposed solution approach are assessed through a series of computational tests. Finally, a case study focusing on an engine production process is presented, leading to the derivation of several valuable insights.
•A joint optimization problem that combines assembly line rebalancing and lot sizing problems.•Stochastic two-stage models are proposed.•Divide-and-conquer algorithm and valid inequalities are utilized. |
| ArticleNumber | 103092 |
| Author | Li, Yuchen Liu, Ming Yang, Zaoli Saldanha-da-Gama, Francisco |
| Author_xml | – sequence: 1 givenname: Yuchen surname: Li fullname: Li, Yuchen email: liyuchen@bjut.edu.cn organization: School of Economics and Management, Beijing University of Technology, China – sequence: 2 givenname: Ming surname: Liu fullname: Liu, Ming email: mingliu@tongji.edu.cn organization: School of Economics and Management, Tongji University, China – sequence: 3 givenname: Francisco orcidid: 0000-0002-2074-1856 surname: Saldanha-da-Gama fullname: Saldanha-da-Gama, Francisco email: francisco.saldanha-da-gama@sheffield.ac.uk organization: Sheffield University Management School, Sheffield, UK – sequence: 4 givenname: Zaoli surname: Yang fullname: Yang, Zaoli email: yangzaoli@bjut.edu.cn organization: School of Economics and Management, Beijing University of Technology, China |
| BookMark | eNqFkMtKAzEUhoNUsK0-gZu8wNRcmnaycCHFGxQE0XXI5cw0dWZSkthSn95p68qFrn744Tuc_xuhQRc6QOiakgkldHaznoQWaj1hhE37hhPJztCQlnNeCDafDtCw70RBpiW_QKOU1oQQWhI-RPDq00ehtxAT4LwLRcq6BpxysCudsrd4E0Mdddv6rsZViFinBK1p9rjxHeAINnSVrz-jzj50eOfzCrt9p9sebULGyX9BukTnlW4SXP3kGL0_3L8tnorly-Pz4m5ZWM7KXDhnONUzXlJKNbMSjBBOcgeG8fncaWOdtYaVVamdcMZKIUBIIx2tNONyxsdInu7aGFKKUCnr8_GxHLVvFCXq4Eut1dGXOvhSJ189y3-xm-hbHff_ULcnCvpZWw9RJeuhs-B8ryYrF_yf_DdpdYtM |
| CitedBy_id | crossref_primary_10_1016_j_est_2025_116706 crossref_primary_10_1016_j_omega_2024_103208 crossref_primary_10_1016_j_cie_2024_110795 crossref_primary_10_1016_j_omega_2024_103183 |
| Cites_doi | 10.1080/00207543.2017.1311048 10.1016/j.ejor.2021.09.043 10.1111/poms.12757 10.1007/s10107-002-0325-y 10.1080/00207540500435116 10.1016/j.ejor.2012.12.029 10.1016/j.ejor.2020.05.064 10.1016/j.eswa.2020.113462 10.1287/opre.2018.1729 10.1016/j.omega.2022.102666 10.1111/1467-9965.00068 10.1016/j.omega.2017.11.006 10.1016/j.jmsy.2013.08.002 10.1016/0360-8352(84)90021-4 10.1080/00207543.2018.1467061 10.1016/j.ins.2020.11.011 10.1080/00207543.2017.1346316 10.1016/j.cor.2018.05.024 10.1016/j.ejor.2019.02.010 10.1108/AA-01-2022-0004 10.1080/00207543.2021.1998694 10.1080/00207543.2017.1353157 10.21314/JOR.2000.038 10.1016/j.cor.2011.03.017 10.1016/j.omega.2011.01.003 10.1007/s10462-022-10149-w 10.1287/ijoc.2017.0777 10.1080/00207540802176046 10.1016/j.omega.2018.02.008 10.1016/j.omega.2020.102335 10.1016/j.omega.2022.102790 10.1016/j.jmsy.2018.12.001 10.1080/00207543.2019.1633023 10.1287/mnsc.30.10.1255 10.1016/j.omega.2023.102895 10.1287/mnsc.37.1.53 10.1007/s00170-016-9014-5 10.1007/s10107-020-01603-0 10.1016/j.ejor.2007.02.052 10.1016/j.tre.2022.102903 10.1080/00207543.2017.1402136 10.1287/mnsc.4.2.115 10.1109/TCYB.2019.2950626 10.1016/0272-6963(81)90033-4 10.1287/mnsc.11.9.874 10.1080/00207543.2015.1088666 10.1080/00207543.2020.1832276 10.1016/j.ijpe.2018.04.012 10.1016/0305-0483(79)90075-6 10.1108/AA-07-2014-061 10.1016/S0378-4266(02)00271-6 10.1016/j.jmsy.2021.05.007 10.1007/BF01589110 10.1016/j.omega.2021.102577 10.1016/j.neucom.2022.06.006 10.1016/j.cor.2024.106605 10.1016/j.cor.2019.104862 |
| ContentType | Journal Article |
| Copyright | 2024 Elsevier Ltd |
| Copyright_xml | – notice: 2024 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.omega.2024.103092 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Business |
| EISSN | 1873-5274 |
| ExternalDocumentID | 10_1016_j_omega_2024_103092 S0305048324000598 |
| GroupedDBID | --K --M -~X .~1 0R~ 13V 1B1 1OL 1RT 1~. 1~5 29N 4.4 457 4G. 5VS 7-5 71M 8P~ 96U 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABJNI ABKBG ABMAC ABMVD ABUCO ABXDB ACBMB ACDAQ ACGFS ACHQT ACHRH ACNCT ACNTT ACRLP ADBBV ADEZE ADIYS ADMUD AEBSH AEKER AENEX AFACB AFAZI AFFNX AFKWA AFTJW AGHFR AGQRV AGUBO AGUMN AGYEJ AHEHV AHHHB AHMBA AIEXJ AIKHN AITUG AJOXV AKRWK ALEQD ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ASPBG AVWKF AXJTR AZFZN BAAKF BDEBP BKOJK BKOMP BLXMC BNSAS CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA HAMUX HVGLF HZ~ IAO IEA IGG IHE IHR IOF IPO ITC J1W KOM LPU LXL LY1 M41 MO0 MS~ N95 O-L O9- OAUVE OHT OZT P-8 P-9 PC. PQQKQ Q38 R2- RIG ROL RPZ SDF SDG SDP SDS SES SEW SPCBC SSB SSD SSL SSZ T5K TAE TAF TN5 U5U VQA WUQ XI7 XPP XSW XYO YNT ZRQ ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADMHG ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP ANKPU APXCP CITATION EFKBS EFLBG IPC ~HD |
| ID | FETCH-LOGICAL-c328t-ddb31a638111a2c9eb55d93deb2377dabcdccb28f8ad5dbc955e59b9d1fa23963 |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001235388300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0483 |
| IngestDate | Tue Nov 18 21:51:48 EST 2025 Sat Nov 29 04:12:52 EST 2025 Tue Jun 18 08:52:28 EDT 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Risk aversion Lot-sizing Multiple lines Stochastic demand Assembly line rebalancing |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c328t-ddb31a638111a2c9eb55d93deb2377dabcdccb28f8ad5dbc955e59b9d1fa23963 |
| ORCID | 0000-0002-2074-1856 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_omega_2024_103092 crossref_primary_10_1016_j_omega_2024_103092 elsevier_sciencedirect_doi_10_1016_j_omega_2024_103092 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-09-01 |
| PublicationDateYYYYMMDD | 2024-09-01 |
| PublicationDate_xml | – month: 09 year: 2024 text: 2024-09-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Omega (Oxford) |
| PublicationYear | 2024 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Sculli (b5) 1979; 7 Zhang, Hu, Wu (b13) 2018; 56 Pochet, Wolsey (b23) 1991; 37 Sereshti, Adulyasak, Jans (b40) 2024; 122 Weskamp, Koberstein, Schwartz, Suhl, Voß (b49) 2019; 83 Meistering, Stadtler (b34) 2017; 26 Fernandez-Viagas, Costa, Framinan (b55) 2020; 153 Zhang, Deng, Jiang, Chen, Qin, Ding (b58) 2021; 60 Brandimarte (b32) 2006; 44 Çimen, Baykasoǧlu, Akyol (b16) 2022; 13 Wu, Liang, Zhang (b27) 2018; 30 Abate, Riccardi, Ruiz (b51) 2022; 111 Jiang, Guan (b47) 2018; 66 Zhang, Hu, Wu (b3) 2020; 58 Yan, Zheng (b56) 2021; 59 Couzon, Ouazene, Yalaoui (b29) 2020; 115 Li, Boucher (b9) 2017; 88 Curcio, Amorim, Zhang, Almada-Lobo (b36) 2018; 202 Li (b1) 2017; 55 Noyan (b42) 2012; 39 Dixon, Silver (b20) 1981; 2 Taube, Minner (b10) 2018; 78 Fernández, Hinojosa, Puerto, Saldanha-da Gama (b48) 2019; 277 Sculli (b6) 1984; 8 Tempelmeier (b33) 2011; 39 Gamberini, Gebennini, Grassi, Regattieri (b7) 2009; 47 Hui, Wang, Bin, Xiong, Lv (b4) 2022; 42 Artzner, Delbaen, Eber, Heath (b60) 1999; 9 Makssoud, Battaïa, Dolgui (b8) 2015; 35 Li, Zuidwijk, de Koster (b59) 2023; 115 Xiao, Zhang, Du, Zhang (b57) 2021; 51 Leung, Magnanti, Vachani (b22) 1989; 45 Wu, Xiao, Zhang, He, Liang (b28) 2018; 98 Saldanha-da Gama (b45) 2022; 166 Behnamian, Ghomi, Karimi, Moludi (b26) 2017; 55 Alimian, Saidi-Mehrabad, Jabbarzadeh (b37) 2019; 50 Hwang (b30) 2022; 193 Otto, Otto, Scholl (b62) 2013; 228 Li, Ye, Imakura, Sakurai (b52) 2022; 501 Mao, Sun, Fang, Huang, Zhang (b12) 2024; 165 Venkatachalam, Narayanan (b25) 2016; 54 Rockafellar, Uryasev (b43) 2000; 2 Markowitz, Todd (b61) 2000 Guillaume, Thierry, Zieliński (b35) 2017; 55 Michels, Costa (b17) 2022; 60 Rockafellar, Uryasev (b44) 2002; 26 Miller, Nemhauser, Savelsbergh (b24) 2003; 94 Barany, Van Roy, Wolsey (b21) 1984; 30 Fan, Ou (b31) 2023; 119 Fábián (b46) 2008; 191 Karas, Ozcelik (b15) 2021; 156 Gurkan, Tunc, Tarim (b38) 2022; 108 Sereshti, Adulyasak, Jans (b39) 2021; 102 Li, Saldanha da Gama, Liu, Yang (b41) 2023; 304 Mínguez, van Ackooij, García-Bertrand (b50) 2021; 288 Belassiria, Mazouzi, ELfezazi, Cherrai, ELMaskaoui (b14) 2018; 56 Dzielinski, Gomory (b19) 1965; 11 Zha, Yu (b2) 2014; 33 Hashemi-Petroodi, Thevenin, Kovalev, Dolgui (b11) 2022; 113 Rodler (b54) 2022; 55 Zhang, Mei, Zhang, Jiang (b53) 2021; 553 Manne (b18) 1958; 4 Taube (10.1016/j.omega.2024.103092_b10) 2018; 78 Pochet (10.1016/j.omega.2024.103092_b23) 1991; 37 Li (10.1016/j.omega.2024.103092_b41) 2023; 304 Markowitz (10.1016/j.omega.2024.103092_b61) 2000 Leung (10.1016/j.omega.2024.103092_b22) 1989; 45 Alimian (10.1016/j.omega.2024.103092_b37) 2019; 50 Rockafellar (10.1016/j.omega.2024.103092_b43) 2000; 2 Gamberini (10.1016/j.omega.2024.103092_b7) 2009; 47 Weskamp (10.1016/j.omega.2024.103092_b49) 2019; 83 Mao (10.1016/j.omega.2024.103092_b12) 2024; 165 Manne (10.1016/j.omega.2024.103092_b18) 1958; 4 Fan (10.1016/j.omega.2024.103092_b31) 2023; 119 Sculli (10.1016/j.omega.2024.103092_b5) 1979; 7 Mínguez (10.1016/j.omega.2024.103092_b50) 2021; 288 Artzner (10.1016/j.omega.2024.103092_b60) 1999; 9 Michels (10.1016/j.omega.2024.103092_b17) 2022; 60 Zhang (10.1016/j.omega.2024.103092_b53) 2021; 553 Jiang (10.1016/j.omega.2024.103092_b47) 2018; 66 Zha (10.1016/j.omega.2024.103092_b2) 2014; 33 Sculli (10.1016/j.omega.2024.103092_b6) 1984; 8 Makssoud (10.1016/j.omega.2024.103092_b8) 2015; 35 Otto (10.1016/j.omega.2024.103092_b62) 2013; 228 Zhang (10.1016/j.omega.2024.103092_b58) 2021; 60 Gurkan (10.1016/j.omega.2024.103092_b38) 2022; 108 Zhang (10.1016/j.omega.2024.103092_b13) 2018; 56 Tempelmeier (10.1016/j.omega.2024.103092_b33) 2011; 39 Fábián (10.1016/j.omega.2024.103092_b46) 2008; 191 Hashemi-Petroodi (10.1016/j.omega.2024.103092_b11) 2022; 113 Dixon (10.1016/j.omega.2024.103092_b20) 1981; 2 Saldanha-da Gama (10.1016/j.omega.2024.103092_b45) 2022; 166 Fernández (10.1016/j.omega.2024.103092_b48) 2019; 277 Li (10.1016/j.omega.2024.103092_b52) 2022; 501 Li (10.1016/j.omega.2024.103092_b1) 2017; 55 Karas (10.1016/j.omega.2024.103092_b15) 2021; 156 Noyan (10.1016/j.omega.2024.103092_b42) 2012; 39 Abate (10.1016/j.omega.2024.103092_b51) 2022; 111 Fernandez-Viagas (10.1016/j.omega.2024.103092_b55) 2020; 153 Wu (10.1016/j.omega.2024.103092_b28) 2018; 98 Barany (10.1016/j.omega.2024.103092_b21) 1984; 30 Sereshti (10.1016/j.omega.2024.103092_b40) 2024; 122 Yan (10.1016/j.omega.2024.103092_b56) 2021; 59 Hui (10.1016/j.omega.2024.103092_b4) 2022; 42 Miller (10.1016/j.omega.2024.103092_b24) 2003; 94 Couzon (10.1016/j.omega.2024.103092_b29) 2020; 115 Sereshti (10.1016/j.omega.2024.103092_b39) 2021; 102 Guillaume (10.1016/j.omega.2024.103092_b35) 2017; 55 Rockafellar (10.1016/j.omega.2024.103092_b44) 2002; 26 Rodler (10.1016/j.omega.2024.103092_b54) 2022; 55 Zhang (10.1016/j.omega.2024.103092_b3) 2020; 58 Çimen (10.1016/j.omega.2024.103092_b16) 2022; 13 Curcio (10.1016/j.omega.2024.103092_b36) 2018; 202 Xiao (10.1016/j.omega.2024.103092_b57) 2021; 51 Behnamian (10.1016/j.omega.2024.103092_b26) 2017; 55 Meistering (10.1016/j.omega.2024.103092_b34) 2017; 26 Dzielinski (10.1016/j.omega.2024.103092_b19) 1965; 11 Wu (10.1016/j.omega.2024.103092_b27) 2018; 30 Brandimarte (10.1016/j.omega.2024.103092_b32) 2006; 44 Li (10.1016/j.omega.2024.103092_b9) 2017; 88 Venkatachalam (10.1016/j.omega.2024.103092_b25) 2016; 54 Belassiria (10.1016/j.omega.2024.103092_b14) 2018; 56 Hwang (10.1016/j.omega.2024.103092_b30) 2022; 193 Li (10.1016/j.omega.2024.103092_b59) 2023; 115 |
| References_xml | – volume: 60 start-page: 6616 year: 2022 end-page: 6636 ident: b17 article-title: Conserving workforce while temporarily rebalancing assembly lines under demand disruption publication-title: Int J Prod Res – volume: 26 start-page: 2247 year: 2017 end-page: 2265 ident: b34 article-title: Stabilized-cycle strategy for capacitated lot sizing with multiple products: Fill-rate constraints in rolling schedules publication-title: Prod Oper Manag – volume: 45 start-page: 331 year: 1989 end-page: 359 ident: b22 article-title: Facets and algorithms for capacitated lot-sizing publication-title: Math Program – volume: 304 start-page: 353 year: 2023 end-page: 365 ident: b41 article-title: A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem publication-title: European J Oper Res – volume: 102 year: 2021 ident: b39 article-title: The value of aggregate service levels in stochastic lot sizing problems publication-title: Omega – volume: 44 start-page: 2997 year: 2006 end-page: 3022 ident: b32 article-title: Multi-item capacitated lot-sizing with demand uncertainty publication-title: Int J Prod Res – volume: 58 start-page: 3589 year: 2020 end-page: 3617 ident: b3 article-title: Improved imperialist competitive algorithms for rebalancing multi-objective two-sided assembly lines with space and resource constraints publication-title: Int J Prod Res – volume: 60 start-page: 59 year: 2021 end-page: 79 ident: b58 article-title: Bi-level dynamic scheduling architecture based on service unit digital twin agents publication-title: J Manuf Syst – volume: 37 start-page: 53 year: 1991 end-page: 67 ident: b23 article-title: Solving multi-item lot-sizing problems using strong cutting planes publication-title: Manage Sci – volume: 83 start-page: 123 year: 2019 end-page: 138 ident: b49 article-title: A two-stage stochastic programming approach for identifying optimal postponement strategies in supply chains with uncertain demand publication-title: Omega – volume: 113 year: 2022 ident: b11 article-title: Model-dependent task assignment in multi-manned mixed-model assembly lines with walking workers publication-title: Omega (United Kingdom) – volume: 193 start-page: 271 year: 2022 end-page: 314 ident: b30 article-title: Subcontracting and lot-sizing with constant capacities publication-title: Math Program – volume: 119 year: 2023 ident: b31 article-title: On dynamic lot sizing with bounded inventory for a perishable product publication-title: Omega – volume: 9 start-page: 203 year: 1999 end-page: 228 ident: b60 article-title: Coherent measures of risk publication-title: Math Finance – volume: 94 start-page: 375 year: 2003 end-page: 405 ident: b24 article-title: On the polyhedral structure of a multi-item production planning model with setup times publication-title: Math Program – volume: 78 start-page: 99 year: 2018 end-page: 111 ident: b10 article-title: Resequencing mixed-model assembly lines with restoration to customer orders publication-title: Omega – volume: 98 start-page: 149 year: 2018 end-page: 164 ident: b28 article-title: The green capacitated multi-item lot sizing problem with parallel machines publication-title: Comput Oper Res – volume: 2 start-page: 23 year: 1981 end-page: 39 ident: b20 article-title: A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem publication-title: J Oper Manage – volume: 88 start-page: 3089 year: 2017 end-page: 3097 ident: b9 article-title: Assembly line balancing problem with task learning and dynamic task reassignment publication-title: Int J Adv Manuf Technol – volume: 39 start-page: 541 year: 2012 end-page: 559 ident: b42 article-title: Risk-averse two-stage stochastic programming with an application to disaster management publication-title: Comput Oper Res – volume: 13 start-page: 363 year: 2022 end-page: 384 ident: b16 article-title: Assembly line rebalancing and worker assignment considering ergonomic risks in an automotive parts manufacturing plant publication-title: Int J Ind Eng Comput – volume: 59 start-page: 7018 year: 2021 end-page: 7036 ident: b56 article-title: An effective and efficient divide-and-conquer algorithm for energy consumption optimisation problem in long Bernoulli serial lines publication-title: Int J Prod Res – volume: 55 start-page: 7334 year: 2017 end-page: 7355 ident: b1 article-title: The type-II assembly line rebalancing problem considering stochastic task learning publication-title: Int J Prod Res – volume: 55 start-page: 5330 year: 2017 end-page: 5340 ident: b26 article-title: A Markovian approach for multi-level multi-product multi-period capacitated lot-sizing problem with uncertainty in levels publication-title: Int J Prod Res – volume: 47 start-page: 2141 year: 2009 end-page: 2164 ident: b7 article-title: A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem publication-title: Int J Prod Res – volume: 55 start-page: 6185 year: 2022 end-page: 6206 ident: b54 article-title: A formal proof and simple explanation of the QuickXplain algorithm publication-title: Artif Intell Rev Vol – year: 2000 ident: b61 article-title: Mean-variance analysis in portfolio choice and capital markets – volume: 50 start-page: 263 year: 2019 end-page: 277 ident: b37 article-title: A robust integrated production and preventive maintenance planning model for multi-state systems with uncertain demand and common cause failures publication-title: J Manuf Syst – volume: 30 start-page: 236 year: 2018 end-page: 258 ident: b27 article-title: Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines publication-title: INFORMS J Comput – volume: 191 start-page: 888 year: 2008 end-page: 911 ident: b46 article-title: Handling CVaR objectives and constraints in two-stage stochastic models publication-title: European J Oper Res – volume: 501 start-page: 664 year: 2022 end-page: 678 ident: b52 article-title: Divide-and-conquer based large-scale spectral clustering publication-title: Neurocomputing – volume: 33 start-page: 93 year: 2014 end-page: 102 ident: b2 article-title: A hybrid ant colony algorithm for U-line balancing and rebalancing in just-in-time production environment publication-title: J Manuf Syst – volume: 111 year: 2022 ident: b51 article-title: Contract design in electricity markets with high penetration of renewables: A two-stage approach publication-title: Omega – volume: 165 year: 2024 ident: b12 article-title: Model and metaheuristic for human? Robot collaboration assembly line worker assignment and balancing problem publication-title: Comput Oper Res – volume: 26 start-page: 1443 year: 2002 end-page: 1471 ident: b44 article-title: Conditional value-at-risk for general loss distributions publication-title: J Bank Financ – volume: 30 start-page: 1255 year: 1984 end-page: 1261 ident: b21 article-title: Strong dormulations for multi-item capacitated lot sizing publication-title: Manage Sci – volume: 2 start-page: 21 year: 2000 end-page: 41 ident: b43 article-title: Optimization of conditional value-at-risk publication-title: J Risk – volume: 54 start-page: 4087 year: 2016 end-page: 4103 ident: b25 article-title: Efficient formulation and heuristics for multi-item single source ordering problem with transportation cost publication-title: Int J Prod Res – volume: 7 start-page: 557 year: 1979 end-page: 561 ident: b5 article-title: Dynamic aspects of line balancing publication-title: Omega – volume: 66 start-page: 1390 year: 2018 end-page: 1405 ident: b47 article-title: Risk-averse two-stage stochastic program with distributional ambiguity publication-title: Oper Res – volume: 56 start-page: 5324 year: 2018 end-page: 5344 ident: b14 article-title: An integrated model for assembly line re-balancing problem publication-title: Int J Prod Res – volume: 35 start-page: 16 year: 2015 end-page: 21 ident: b8 article-title: Re-balancing problem for assembly lines : New mathematical model and exact solution publication-title: Assem Autom – volume: 156 year: 2021 ident: b15 article-title: Assembly line worker assignment and rebalancing problem: A mathematical model and an artificial bee colony algorithm publication-title: Comput Ind Eng – volume: 277 start-page: 215 year: 2019 end-page: 226 ident: b48 article-title: New algorithmic framework for conditional value at risk: Application to stochastic fixed-charge transportation publication-title: European J Oper Res – volume: 11 start-page: 874 year: 1965 end-page: 890 ident: b19 article-title: Optimal programming of lot sizes, inventory and labor allocations publication-title: Manage Sci – volume: 39 start-page: 627 year: 2011 end-page: 633 ident: b33 article-title: A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint publication-title: Omega – volume: 51 start-page: 4173 year: 2021 end-page: 4186 ident: b57 article-title: An evolutionary multiobjective route grouping-based heuristic algorithm for large-scale capacitated vehicle routing problems publication-title: IEEE Trans Cybern – volume: 153 year: 2020 ident: b55 article-title: Hybrid flow shop with multiple servers: A computational evaluation and efficient divide-and-conquer heuristics publication-title: Expert Syst Appl – volume: 108 year: 2022 ident: b38 article-title: The joint stochastic lot sizing and pricing problem publication-title: Omega – volume: 115 year: 2020 ident: b29 article-title: Joint optimization of dynamic pricing and lot-sizing decisions with nonlinear demands: Theoretical and computational analysis publication-title: Comput Oper Res – volume: 122 year: 2024 ident: b40 article-title: Managing flexibility in stochastic multi-level lot sizing problem with service level constraints publication-title: Omega (United Kingdom) – volume: 553 start-page: 208 year: 2021 end-page: 224 ident: b53 article-title: Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition publication-title: Inform Sci – volume: 42 start-page: 490 year: 2022 end-page: 505 ident: b4 article-title: Chance-constrained programming with robustness for lot-sizing and scheduling problems under complex uncertainty publication-title: Assem Autom – volume: 228 start-page: 33 year: 2013 end-page: 45 ident: b62 article-title: Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing publication-title: European J Oper Res – volume: 8 start-page: 53 year: 1984 end-page: 63 ident: b6 article-title: Short term adjustments to production lines publication-title: Comput Ind Eng – volume: 56 start-page: 3043 year: 2018 end-page: 3063 ident: b13 article-title: A modified multi-objective genetic algorithm for two-sided assembly line re-balancing problem of a shovel loader publication-title: Int J Prod Res – volume: 115 year: 2023 ident: b59 article-title: Optimal competitive capacity strategies: Evidence from the container shipping market publication-title: Omega – volume: 4 start-page: 115 year: 1958 end-page: 136 ident: b18 article-title: Programming of economic lot-sizes publication-title: Manage Sci – volume: 288 start-page: 194 year: 2021 end-page: 206 ident: b50 article-title: Constraint generation for risk averse two-stage stochastic programs publication-title: European J Oper Res – volume: 166 year: 2022 ident: b45 article-title: Facility location in logistics and transportation: An enduring relationship publication-title: Transp Res Part E: Logist Transp Rev – volume: 55 start-page: 6824 year: 2017 end-page: 6845 ident: b35 article-title: Robust material requirement planning with cumulative demand under uncertainty publication-title: Int J Prod Res – volume: 202 start-page: 81 year: 2018 end-page: 96 ident: b36 article-title: Adaptation and approximate strategies for solving the lot-sizing and scheduling problem under multistage demand uncertainty publication-title: Int J Prod Econ – volume: 55 start-page: 5330 issue: 18 year: 2017 ident: 10.1016/j.omega.2024.103092_b26 article-title: A Markovian approach for multi-level multi-product multi-period capacitated lot-sizing problem with uncertainty in levels publication-title: Int J Prod Res doi: 10.1080/00207543.2017.1311048 – volume: 304 start-page: 353 issue: 1 year: 2023 ident: 10.1016/j.omega.2024.103092_b41 article-title: A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem publication-title: European J Oper Res doi: 10.1016/j.ejor.2021.09.043 – volume: 26 start-page: 2247 year: 2017 ident: 10.1016/j.omega.2024.103092_b34 article-title: Stabilized-cycle strategy for capacitated lot sizing with multiple products: Fill-rate constraints in rolling schedules publication-title: Prod Oper Manag doi: 10.1111/poms.12757 – volume: 94 start-page: 375 year: 2003 ident: 10.1016/j.omega.2024.103092_b24 article-title: On the polyhedral structure of a multi-item production planning model with setup times publication-title: Math Program doi: 10.1007/s10107-002-0325-y – volume: 44 start-page: 2997 issue: 15 year: 2006 ident: 10.1016/j.omega.2024.103092_b32 article-title: Multi-item capacitated lot-sizing with demand uncertainty publication-title: Int J Prod Res doi: 10.1080/00207540500435116 – volume: 228 start-page: 33 issue: 1 year: 2013 ident: 10.1016/j.omega.2024.103092_b62 article-title: Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing publication-title: European J Oper Res doi: 10.1016/j.ejor.2012.12.029 – volume: 288 start-page: 194 issue: 1 year: 2021 ident: 10.1016/j.omega.2024.103092_b50 article-title: Constraint generation for risk averse two-stage stochastic programs publication-title: European J Oper Res doi: 10.1016/j.ejor.2020.05.064 – volume: 153 year: 2020 ident: 10.1016/j.omega.2024.103092_b55 article-title: Hybrid flow shop with multiple servers: A computational evaluation and efficient divide-and-conquer heuristics publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2020.113462 – volume: 66 start-page: 1390 year: 2018 ident: 10.1016/j.omega.2024.103092_b47 article-title: Risk-averse two-stage stochastic program with distributional ambiguity publication-title: Oper Res doi: 10.1287/opre.2018.1729 – volume: 111 year: 2022 ident: 10.1016/j.omega.2024.103092_b51 article-title: Contract design in electricity markets with high penetration of renewables: A two-stage approach publication-title: Omega doi: 10.1016/j.omega.2022.102666 – volume: 9 start-page: 203 year: 1999 ident: 10.1016/j.omega.2024.103092_b60 article-title: Coherent measures of risk publication-title: Math Finance doi: 10.1111/1467-9965.00068 – volume: 78 start-page: 99 year: 2018 ident: 10.1016/j.omega.2024.103092_b10 article-title: Resequencing mixed-model assembly lines with restoration to customer orders publication-title: Omega doi: 10.1016/j.omega.2017.11.006 – volume: 33 start-page: 93 issue: 1 year: 2014 ident: 10.1016/j.omega.2024.103092_b2 article-title: A hybrid ant colony algorithm for U-line balancing and rebalancing in just-in-time production environment publication-title: J Manuf Syst doi: 10.1016/j.jmsy.2013.08.002 – volume: 8 start-page: 53 issue: 1 year: 1984 ident: 10.1016/j.omega.2024.103092_b6 article-title: Short term adjustments to production lines publication-title: Comput Ind Eng doi: 10.1016/0360-8352(84)90021-4 – volume: 56 start-page: 5324 issue: 16 year: 2018 ident: 10.1016/j.omega.2024.103092_b14 article-title: An integrated model for assembly line re-balancing problem publication-title: Int J Prod Res doi: 10.1080/00207543.2018.1467061 – volume: 553 start-page: 208 year: 2021 ident: 10.1016/j.omega.2024.103092_b53 article-title: Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition publication-title: Inform Sci doi: 10.1016/j.ins.2020.11.011 – volume: 55 start-page: 7334 issue: 24 year: 2017 ident: 10.1016/j.omega.2024.103092_b1 article-title: The type-II assembly line rebalancing problem considering stochastic task learning publication-title: Int J Prod Res doi: 10.1080/00207543.2017.1346316 – volume: 98 start-page: 149 year: 2018 ident: 10.1016/j.omega.2024.103092_b28 article-title: The green capacitated multi-item lot sizing problem with parallel machines publication-title: Comput Oper Res doi: 10.1016/j.cor.2018.05.024 – volume: 277 start-page: 215 year: 2019 ident: 10.1016/j.omega.2024.103092_b48 article-title: New algorithmic framework for conditional value at risk: Application to stochastic fixed-charge transportation publication-title: European J Oper Res doi: 10.1016/j.ejor.2019.02.010 – year: 2000 ident: 10.1016/j.omega.2024.103092_b61 – volume: 42 start-page: 490 issue: 4 year: 2022 ident: 10.1016/j.omega.2024.103092_b4 article-title: Chance-constrained programming with robustness for lot-sizing and scheduling problems under complex uncertainty publication-title: Assem Autom doi: 10.1108/AA-01-2022-0004 – volume: 60 start-page: 6616 issue: 21 year: 2022 ident: 10.1016/j.omega.2024.103092_b17 article-title: Conserving workforce while temporarily rebalancing assembly lines under demand disruption publication-title: Int J Prod Res doi: 10.1080/00207543.2021.1998694 – volume: 55 start-page: 6824 issue: 22 year: 2017 ident: 10.1016/j.omega.2024.103092_b35 article-title: Robust material requirement planning with cumulative demand under uncertainty publication-title: Int J Prod Res doi: 10.1080/00207543.2017.1353157 – volume: 2 start-page: 21 year: 2000 ident: 10.1016/j.omega.2024.103092_b43 article-title: Optimization of conditional value-at-risk publication-title: J Risk doi: 10.21314/JOR.2000.038 – volume: 122 year: 2024 ident: 10.1016/j.omega.2024.103092_b40 article-title: Managing flexibility in stochastic multi-level lot sizing problem with service level constraints publication-title: Omega (United Kingdom) – volume: 39 start-page: 541 year: 2012 ident: 10.1016/j.omega.2024.103092_b42 article-title: Risk-averse two-stage stochastic programming with an application to disaster management publication-title: Comput Oper Res doi: 10.1016/j.cor.2011.03.017 – volume: 113 year: 2022 ident: 10.1016/j.omega.2024.103092_b11 article-title: Model-dependent task assignment in multi-manned mixed-model assembly lines with walking workers publication-title: Omega (United Kingdom) – volume: 39 start-page: 627 year: 2011 ident: 10.1016/j.omega.2024.103092_b33 article-title: A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint publication-title: Omega doi: 10.1016/j.omega.2011.01.003 – volume: 55 start-page: 6185 year: 2022 ident: 10.1016/j.omega.2024.103092_b54 article-title: A formal proof and simple explanation of the QuickXplain algorithm publication-title: Artif Intell Rev Vol doi: 10.1007/s10462-022-10149-w – volume: 30 start-page: 236 year: 2018 ident: 10.1016/j.omega.2024.103092_b27 article-title: Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines publication-title: INFORMS J Comput doi: 10.1287/ijoc.2017.0777 – volume: 47 start-page: 2141 issue: 8 year: 2009 ident: 10.1016/j.omega.2024.103092_b7 article-title: A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem publication-title: Int J Prod Res doi: 10.1080/00207540802176046 – volume: 83 start-page: 123 year: 2019 ident: 10.1016/j.omega.2024.103092_b49 article-title: A two-stage stochastic programming approach for identifying optimal postponement strategies in supply chains with uncertain demand publication-title: Omega doi: 10.1016/j.omega.2018.02.008 – volume: 102 year: 2021 ident: 10.1016/j.omega.2024.103092_b39 article-title: The value of aggregate service levels in stochastic lot sizing problems publication-title: Omega doi: 10.1016/j.omega.2020.102335 – volume: 115 year: 2023 ident: 10.1016/j.omega.2024.103092_b59 article-title: Optimal competitive capacity strategies: Evidence from the container shipping market publication-title: Omega doi: 10.1016/j.omega.2022.102790 – volume: 13 start-page: 363 issue: 3 year: 2022 ident: 10.1016/j.omega.2024.103092_b16 article-title: Assembly line rebalancing and worker assignment considering ergonomic risks in an automotive parts manufacturing plant publication-title: Int J Ind Eng Comput – volume: 50 start-page: 263 year: 2019 ident: 10.1016/j.omega.2024.103092_b37 article-title: A robust integrated production and preventive maintenance planning model for multi-state systems with uncertain demand and common cause failures publication-title: J Manuf Syst doi: 10.1016/j.jmsy.2018.12.001 – volume: 58 start-page: 3589 issue: 12 year: 2020 ident: 10.1016/j.omega.2024.103092_b3 article-title: Improved imperialist competitive algorithms for rebalancing multi-objective two-sided assembly lines with space and resource constraints publication-title: Int J Prod Res doi: 10.1080/00207543.2019.1633023 – volume: 30 start-page: 1255 year: 1984 ident: 10.1016/j.omega.2024.103092_b21 article-title: Strong dormulations for multi-item capacitated lot sizing publication-title: Manage Sci doi: 10.1287/mnsc.30.10.1255 – volume: 119 year: 2023 ident: 10.1016/j.omega.2024.103092_b31 article-title: On dynamic lot sizing with bounded inventory for a perishable product publication-title: Omega doi: 10.1016/j.omega.2023.102895 – volume: 37 start-page: 53 year: 1991 ident: 10.1016/j.omega.2024.103092_b23 article-title: Solving multi-item lot-sizing problems using strong cutting planes publication-title: Manage Sci doi: 10.1287/mnsc.37.1.53 – volume: 88 start-page: 3089 issue: 9–12 year: 2017 ident: 10.1016/j.omega.2024.103092_b9 article-title: Assembly line balancing problem with task learning and dynamic task reassignment publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-016-9014-5 – volume: 156 issue: March year: 2021 ident: 10.1016/j.omega.2024.103092_b15 article-title: Assembly line worker assignment and rebalancing problem: A mathematical model and an artificial bee colony algorithm publication-title: Comput Ind Eng – volume: 193 start-page: 271 issue: 1 year: 2022 ident: 10.1016/j.omega.2024.103092_b30 article-title: Subcontracting and lot-sizing with constant capacities publication-title: Math Program doi: 10.1007/s10107-020-01603-0 – volume: 191 start-page: 888 year: 2008 ident: 10.1016/j.omega.2024.103092_b46 article-title: Handling CVaR objectives and constraints in two-stage stochastic models publication-title: European J Oper Res doi: 10.1016/j.ejor.2007.02.052 – volume: 166 year: 2022 ident: 10.1016/j.omega.2024.103092_b45 article-title: Facility location in logistics and transportation: An enduring relationship publication-title: Transp Res Part E: Logist Transp Rev doi: 10.1016/j.tre.2022.102903 – volume: 56 start-page: 3043 issue: 9 year: 2018 ident: 10.1016/j.omega.2024.103092_b13 article-title: A modified multi-objective genetic algorithm for two-sided assembly line re-balancing problem of a shovel loader publication-title: Int J Prod Res doi: 10.1080/00207543.2017.1402136 – volume: 4 start-page: 115 year: 1958 ident: 10.1016/j.omega.2024.103092_b18 article-title: Programming of economic lot-sizes publication-title: Manage Sci doi: 10.1287/mnsc.4.2.115 – volume: 51 start-page: 4173 issue: 8 year: 2021 ident: 10.1016/j.omega.2024.103092_b57 article-title: An evolutionary multiobjective route grouping-based heuristic algorithm for large-scale capacitated vehicle routing problems publication-title: IEEE Trans Cybern doi: 10.1109/TCYB.2019.2950626 – volume: 2 start-page: 23 year: 1981 ident: 10.1016/j.omega.2024.103092_b20 article-title: A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem publication-title: J Oper Manage doi: 10.1016/0272-6963(81)90033-4 – volume: 11 start-page: 874 year: 1965 ident: 10.1016/j.omega.2024.103092_b19 article-title: Optimal programming of lot sizes, inventory and labor allocations publication-title: Manage Sci doi: 10.1287/mnsc.11.9.874 – volume: 54 start-page: 4087 year: 2016 ident: 10.1016/j.omega.2024.103092_b25 article-title: Efficient formulation and heuristics for multi-item single source ordering problem with transportation cost publication-title: Int J Prod Res doi: 10.1080/00207543.2015.1088666 – volume: 59 start-page: 7018 issue: 23 year: 2021 ident: 10.1016/j.omega.2024.103092_b56 article-title: An effective and efficient divide-and-conquer algorithm for energy consumption optimisation problem in long Bernoulli serial lines publication-title: Int J Prod Res doi: 10.1080/00207543.2020.1832276 – volume: 202 start-page: 81 year: 2018 ident: 10.1016/j.omega.2024.103092_b36 article-title: Adaptation and approximate strategies for solving the lot-sizing and scheduling problem under multistage demand uncertainty publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2018.04.012 – volume: 7 start-page: 557 issue: 6 year: 1979 ident: 10.1016/j.omega.2024.103092_b5 article-title: Dynamic aspects of line balancing publication-title: Omega doi: 10.1016/0305-0483(79)90075-6 – volume: 35 start-page: 16 issue: 1 year: 2015 ident: 10.1016/j.omega.2024.103092_b8 article-title: Re-balancing problem for assembly lines : New mathematical model and exact solution publication-title: Assem Autom doi: 10.1108/AA-07-2014-061 – volume: 26 start-page: 1443 issue: 7 year: 2002 ident: 10.1016/j.omega.2024.103092_b44 article-title: Conditional value-at-risk for general loss distributions publication-title: J Bank Financ doi: 10.1016/S0378-4266(02)00271-6 – volume: 60 start-page: 59 year: 2021 ident: 10.1016/j.omega.2024.103092_b58 article-title: Bi-level dynamic scheduling architecture based on service unit digital twin agents publication-title: J Manuf Syst doi: 10.1016/j.jmsy.2021.05.007 – volume: 45 start-page: 331 year: 1989 ident: 10.1016/j.omega.2024.103092_b22 article-title: Facets and algorithms for capacitated lot-sizing publication-title: Math Program doi: 10.1007/BF01589110 – volume: 108 year: 2022 ident: 10.1016/j.omega.2024.103092_b38 article-title: The joint stochastic lot sizing and pricing problem publication-title: Omega doi: 10.1016/j.omega.2021.102577 – volume: 501 start-page: 664 year: 2022 ident: 10.1016/j.omega.2024.103092_b52 article-title: Divide-and-conquer based large-scale spectral clustering publication-title: Neurocomputing doi: 10.1016/j.neucom.2022.06.006 – volume: 165 year: 2024 ident: 10.1016/j.omega.2024.103092_b12 article-title: Model and metaheuristic for human? Robot collaboration assembly line worker assignment and balancing problem publication-title: Comput Oper Res doi: 10.1016/j.cor.2024.106605 – volume: 115 year: 2020 ident: 10.1016/j.omega.2024.103092_b29 article-title: Joint optimization of dynamic pricing and lot-sizing decisions with nonlinear demands: Theoretical and computational analysis publication-title: Comput Oper Res doi: 10.1016/j.cor.2019.104862 |
| SSID | ssj0001803 |
| Score | 2.4706225 |
| Snippet | In this paper, a comprehensive optimization problem is developed for a composite of an assembly line reconfiguration problem with multiple lines and a... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 103092 |
| SubjectTerms | Assembly line rebalancing Lot-sizing Multiple lines Risk aversion Stochastic demand |
| Title | Risk-averse two-stage stochastic programming for assembly line reconfiguration with dynamic lot sizes |
| URI | https://dx.doi.org/10.1016/j.omega.2024.103092 |
| Volume | 127 |
| WOSCitedRecordID | wos001235388300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-5274 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001803 issn: 0305-0483 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FFCEuiKdaXtoDt7BRvI6x91ih8hIqCBUpcLH25dTFsavaKYEjv5xZ7yOhRRE9cLEiaz2xPZ9mPo--nUHomWaqKFSUETNQkkw11QRYqyKURSyNNU8nQvXDJtLDw2w2Yx8Hg19-L8x5ldZ1tlqx0__qajgHzjZbZ6_g7mAUTsBvcDocwe1w_CfHfyrbb4QbtYUedd8bAvRvbtrINvKYm6bMXpK1CBrKttULUf0Y9Yyz_0IuyvnSQaMv1Co7t35UNd2oLX863aHjtB8Wes77tqUrq5QPtYX3vVTgyxKAsVb-lEsr13cp01R3eKV4fcyJ4uQ1X3BPqGXZyiaEJVfY_sqbqtysVdBpEGOFPVpGKji1o2tC_LXNAVwENWPP7HS8S8Hd1hlOxo15rLGxP16v_rOV9oUUF4SHXtN2kvdGcmMkt0auoR2aJiwbop39twezdyGfR9nEDtl29-57V_UqwUv38nd-s8FZjm6jW-5jA-9bkNxBA13fRTf8Xod7SG9gBQes4DVW8AZWMDgXe6xggxV8ASvYYAU7rGDACu6xch99fnVw9PINcXM3iIxp1hGlRBxxCMyQBzmVTIskUSxWWtA4TRUXUkkpaFZkXCVKSJYkOmGCqajgNIaI_gAN66bWuwhDKhVGbCAKeEPFNOLAiHlqiBkslhO-h6h_W7l0TenNbJQq3-KpPfQ8XHRqe7JsX_7CuyF3tNLSxRyAte3Ch1f7n0fo5hrzj9GwO1vqJ-i6PO_K9uypQ9VvLfqdUw |
| linkProvider | Elsevier |
| 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=Risk-averse+two-stage+stochastic+programming+for+assembly+line+reconfiguration+with+dynamic+lot+sizes&rft.jtitle=Omega+%28Oxford%29&rft.au=Li%2C+Yuchen&rft.au=Liu%2C+Ming&rft.au=Saldanha-da-Gama%2C+Francisco&rft.au=Yang%2C+Zaoli&rft.date=2024-09-01&rft.issn=0305-0483&rft.volume=127&rft.spage=103092&rft_id=info:doi/10.1016%2Fj.omega.2024.103092&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_omega_2024_103092 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0483&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0483&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0483&client=summon |