A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales

•We study a multi-echelon stochastic lot-sizing problem within remanufacturing environment.•It is modelled as a multi-stage stochastic integer program and solved by a Branch & Cut algorithm.•We propose a new family of tree valid inequalities generated by a mixing procedure.•A heuristic algorithm...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 116; s. 104865
Hlavní autoři:	Quezada, Franco, Gicquel, Céline, Kedad-Sidhoum, Safia, Vu, Dong Quan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.04.2020 Pergamon Press Inc Elsevier
Témata:	Algorithms Branch-and-cut algorithm Computer Science Computer simulation Horizon Inequalities Integer programming Integers Lost sales Lot sizing Multi-stage stochastic integer programming Operations Research Optimization Production scheduling Refurbishment Remanufacturing Remanufacturing system Scenario tree Stochastic lot-sizing Valid inequalities Lost sales Scenario tree Multi-stage stochastic integer programming Valid inequalities Branch-and-cut algorithm Stochastic lot-sizing Remanufacturing system multi-stage stochastic integer programming scenario tree remanufacturing system valid inequalities branch-and-cut algorithm lost sales
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	•We study a multi-echelon stochastic lot-sizing problem within remanufacturing environment.•It is modelled as a multi-stage stochastic integer program and solved by a Branch & Cut algorithm.•We propose a new family of tree valid inequalities generated by a mixing procedure.•A heuristic algorithm is studied to solve the separation problem.•The time needed to obtain guaranteed optimal solutions is significantly reduced and the value of the stochastic solution is assessed providing significantly improvement. We consider an uncapacitated multi-item multi-echelon lot-sizing problem within a remanufacturing system involving three production echelons: disassembly, refurbishing and reassembly. We seek to plan the production activities on this system over a multi-period horizon. We consider a stochastic environment, in which the input data of the optimization problem are subject to uncertainty. We propose a multi-stage stochastic integer programming approach relying on scenario trees to represent the uncertain information structure and develop a branch-and-cut algorithm in order to solve the resulting mixed-integer linear program to optimality. This algorithm relies on a new set of tree inequalities obtained by combining valid inequalities previously known for each individual scenario of the scenario tree. These inequalities are used within a cutting-plane generation procedure based on a heuristic resolution of the corresponding separation problem. Computational experiments carried out on randomly generated instances show that the proposed branch-and-cut algorithm performs well as compared to the use of a stand-alone mathematical solver. Finally, rolling horizon simulations are carried out to assess the practical performance of the multi-stage stochastic planning model with respect to a deterministic model and a two-stage stochastic planning model.
AbstractList	We consider an uncapacitated multi-item multi-echelon lot-sizing problem within a remanufacturing system involving three production echelons: disassembly, refurbishing and reassembly. We seek to plan the production activities on this system over a multi-period horizon. We consider a stochastic environment, in which the input data of the optimization problem are subject to uncertainty. We propose a multi-stage stochastic integer programming approach relying on scenario trees to represent the uncertain information structure and develop a branch-and-cut algorithm in order to solve the resulting mixed-integer linear program to optimality. This algorithm relies on a new set of tree inequalities obtained by combining valid inequalities previously known for each individual scenario of the scenario tree. These inequalities are used within a cutting-plane generation procedure based on a heuristic resolution of the corresponding separation problem. Computational experiments carried out on randomly generated instances show that the proposed branch-and-cut algorithm performs well as compared to the use of a stand-alone mathematical solver. Finally, rolling horizon simulations are carried out to assess the practical performance of the multi-stage stochastic planning model with respect to a deterministic model and a two-stage stochastic planning model. •We study a multi-echelon stochastic lot-sizing problem within remanufacturing environment.•It is modelled as a multi-stage stochastic integer program and solved by a Branch & Cut algorithm.•We propose a new family of tree valid inequalities generated by a mixing procedure.•A heuristic algorithm is studied to solve the separation problem.•The time needed to obtain guaranteed optimal solutions is significantly reduced and the value of the stochastic solution is assessed providing significantly improvement. We consider an uncapacitated multi-item multi-echelon lot-sizing problem within a remanufacturing system involving three production echelons: disassembly, refurbishing and reassembly. We seek to plan the production activities on this system over a multi-period horizon. We consider a stochastic environment, in which the input data of the optimization problem are subject to uncertainty. We propose a multi-stage stochastic integer programming approach relying on scenario trees to represent the uncertain information structure and develop a branch-and-cut algorithm in order to solve the resulting mixed-integer linear program to optimality. This algorithm relies on a new set of tree inequalities obtained by combining valid inequalities previously known for each individual scenario of the scenario tree. These inequalities are used within a cutting-plane generation procedure based on a heuristic resolution of the corresponding separation problem. Computational experiments carried out on randomly generated instances show that the proposed branch-and-cut algorithm performs well as compared to the use of a stand-alone mathematical solver. Finally, rolling horizon simulations are carried out to assess the practical performance of the multi-stage stochastic planning model with respect to a deterministic model and a two-stage stochastic planning model.
ArticleNumber	104865
Author	Gicquel, Céline Vu, Dong Quan Kedad-Sidhoum, Safia Quezada, Franco
Author_xml	– sequence: 1 givenname: Franco surname: Quezada fullname: Quezada, Franco email: franco.quezada@lip6.fr organization: Sorbonne Université, CNRS, Laboratoire d’informatique de Paris 6, LIP6, Paris F-75005, France – sequence: 2 givenname: Céline surname: Gicquel fullname: Gicquel, Céline organization: Université Paris-Saclay, Laboratoire de Recherche en Informatique, LRI, Gif-sur-Yvette 91190, France – sequence: 3 givenname: Safia surname: Kedad-Sidhoum fullname: Kedad-Sidhoum, Safia organization: CNAM, Centre d’Études et de Recherche en Informatique et Communications, CEDRIC, Paris F-75003, France – sequence: 4 givenname: Dong Quan orcidid: 0000-0003-2276-8873 surname: Vu fullname: Vu, Dong Quan organization: Nokia Bell Labs, Nokia Paris-Saclay, Route de Villejust, Nozay 91620, France
BackLink	https://hal.science/hal-02470310$$DView record in HAL
BookMark	eNp9kc1q3DAURkVJoZM0D9CdoKsuPNW1fmzT1RDapDDQTQvZCY18PdZgS1NJkzZ9-mhwuski2ogrzhEf97skFz54JOQDsDUwUJ8PaxviumbQlVm0Sr4hK2gbXjVK3l-QFeNMVkyK9h25TOnAymlqWJG_GzqfpuyqlM0eacrBjiZlZ6nzGfcY6TGGfTTz7PyemmOZjB3pECI1zybaEafg6RRyldy_M1eo3YQz_ePySCPmU_SJGt8XJmWazITpPXk7mCnh9fN9RX59-_rz5q7a_rj9frPZVlZwkSsAgc2A0PWc71RnrFSC7eoWFAyDkYNRna1tJ8CIum0k9FZ2LTDVWrSNGgZ-RT4t_45m0sfoZhMfdTBO3222-vzGatEwDuwBCvtxYUv-3ydMWR9CiV7i6ZqrjoOSXVOoZqFsDClFHLR12WQXfI7GTRqYPleiD7pUos-V6KWSYsIL83-g15wvi4NlSQ8Oo07WobfYu4g26z64V-wnNfGm9Q
CitedBy_id	crossref_primary_10_1016_j_cie_2023_109412 crossref_primary_10_1080_00207543_2022_2098872 crossref_primary_10_1016_j_omega_2023_102957 crossref_primary_10_1287_ijoc_2022_1215 crossref_primary_10_1051_ro_2025107 crossref_primary_10_1080_0305215X_2021_1940990 crossref_primary_10_1111_itor_13305 crossref_primary_10_1016_j_ifacol_2022_10_130 crossref_primary_10_1016_j_ejor_2022_04_023 crossref_primary_10_1109_TEM_2022_3230752 crossref_primary_10_1016_j_cor_2022_106025 crossref_primary_10_1109_TASE_2025_3535945 crossref_primary_10_1016_j_dam_2025_08_051 crossref_primary_10_1016_j_ejor_2022_03_025 crossref_primary_10_1016_j_ijpe_2024_109308 crossref_primary_10_1016_j_cor_2021_105302 crossref_primary_10_1016_j_cor_2021_105434 crossref_primary_10_1080_00207543_2022_2122622 crossref_primary_10_1007_s00170_021_07646_7 crossref_primary_10_1016_j_ifacol_2022_09_580 crossref_primary_10_1007_s13243_025_00150_1 crossref_primary_10_1080_00207543_2022_2120924
Cites_doi	10.1109/TEM.2009.2024506 10.1016/S0272-6963(00)00034-6 10.3182/20130619-3-RU-3018.00554 10.1287/mnsc.2013.1822 10.1016/S0736-5845(99)00020-4 10.1080/00207540500250507 10.1007/s00170-015-7445-z 10.1016/j.jenvman.2009.09.037 10.1080/00207540903055727 10.1080/09537287.2011.561815 10.1287/opre.1080.0535 10.1080/00207543.2012.737940 10.1007/PL00011411 10.1080/00207543.2010.535038 10.1007/s10107-005-0572-9 10.1080/00207540500435116 10.1016/j.ejor.2017.12.041 10.1007/s10898-017-0500-6 10.1007/s00291-016-0441-3 10.1080/00207540701837029 10.1016/j.orl.2007.04.007
ContentType	Journal Article
Copyright	2019 Copyright Pergamon Press Inc. Apr 2020 Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml	– notice: 2019 – notice: Copyright Pergamon Press Inc. Apr 2020 – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID	AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 1XC VOOES
DOI	10.1016/j.cor.2019.104865
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) Hyper Article en Ligne (HAL) (Open Access)
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	Engineering Computer Science Business
EISSN	1873-765X 0305-0548
ExternalDocumentID	oai:HAL:hal-02470310v1 10_1016_j_cor_2019_104865 S0305054819303077
GroupedDBID	--K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D 1XC VOOES
ID	FETCH-LOGICAL-c434t-114e7fe19d33b69ac5640b28161ffa5fa69c2c941a428751dc5981068cec76ff3
ISICitedReferencesCount	25
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000515443800007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0305-0548
IngestDate	Tue Oct 14 20:33:02 EDT 2025 Sun Nov 09 06:38:05 EST 2025 Sat Nov 29 07:20:26 EST 2025 Tue Nov 18 21:48:57 EST 2025 Fri Feb 23 02:49:34 EST 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Keywords	Lost sales Scenario tree Multi-stage stochastic integer programming Valid inequalities Branch-and-cut algorithm Stochastic lot-sizing Remanufacturing system multi-stage stochastic integer programming scenario tree remanufacturing system valid inequalities branch-and-cut algorithm lost sales
Language	English
License	Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c434t-114e7fe19d33b69ac5640b28161ffa5fa69c2c941a428751dc5981068cec76ff3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0003-2276-8873 0000-0001-5763-5582 0000-0002-2719-7443 0000-0002-2184-2261
OpenAccessLink	https://hal.science/hal-02470310
PQID	2369316597
PQPubID	45870
ParticipantIDs	hal_primary_oai_HAL_hal_02470310v1 proquest_journals_2369316597 crossref_citationtrail_10_1016_j_cor_2019_104865 crossref_primary_10_1016_j_cor_2019_104865 elsevier_sciencedirect_doi_10_1016_j_cor_2019_104865
PublicationCentury	2000
PublicationDate	2020-04-01
PublicationDateYYYYMMDD	2020-04-01
PublicationDate_xml	– month: 04 year: 2020 text: 2020-04-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Computers & operations research
PublicationYear	2020
Publisher	Elsevier Ltd Pergamon Press Inc Elsevier
Publisher_xml	– name: Elsevier Ltd – name: Pergamon Press Inc – name: Elsevier
References	Lage Junior, Filho (bib0016) 2012; 23 Loparic, Pochet, Wolsey (bib0018) 2001; 89 Jayaraman (bib0012) 2006; 44 Lund, Mundial (bib0019) 1984; vol. 31 Li, Liu, Cao, Wang (bib0017) 2009; 47 Kazemi Zanjani, Nourelfath, Ait-Kadi (bib0013) 2010; 48 Wang, Huang (bib0023) 2013; 51 Guide, Jayaraman, Srivastava (bib0009) 1999; 15 Denizel, Ferguson (bib0003) 2010; 57 Hilger, Sahling, Tempelmeier (bib0010) 2016; 38 Brandimarte (bib0002) 2006; 44 Guan, Ahmed, Nemhauser, Miller (bib0007) 2006; 105 Kilic, Tunc, Tarim (bib0015) 2018; 267 Macedo, Alem, Santos, Junior, Moreno (bib0020) 2016; 82 Ilgin, Gupta (bib0011) 2010; 91 Fang, Liu, Pardalos, Long, Pei, Zuo (bib0005) 2017; 68 Guan, Ahmed, Nemhauser (bib0006) 2009; 57 Di Summa, Wolsey (bib0004) 2008; 36 Kilic (bib0014) 2013; 46 Naeem, Dias, Tibrewal, Chang, Tiwari (bib0021) 2013 Guide (bib0008) 2000; 18 Zhang, Küçükyavuz, Goel (bib0024) 2014; 60 Pochet, Wolsey (bib0022) 2006 Ahn, Lee, Kim (bib0001) 2011; 49 Guide (10.1016/j.cor.2019.104865_bib0009) 1999; 15 Hilger (10.1016/j.cor.2019.104865_bib0010) 2016; 38 Guan (10.1016/j.cor.2019.104865_bib0007) 2006; 105 Fang (10.1016/j.cor.2019.104865_bib0005) 2017; 68 Ilgin (10.1016/j.cor.2019.104865_bib0011) 2010; 91 Kazemi Zanjani (10.1016/j.cor.2019.104865_bib0013) 2010; 48 Kilic (10.1016/j.cor.2019.104865_bib0015) 2018; 267 Pochet (10.1016/j.cor.2019.104865_bib0022) 2006 Di Summa (10.1016/j.cor.2019.104865_bib0004) 2008; 36 Lage Junior (10.1016/j.cor.2019.104865_bib0016) 2012; 23 Zhang (10.1016/j.cor.2019.104865_bib0024) 2014; 60 Guan (10.1016/j.cor.2019.104865_bib0006) 2009; 57 Lund (10.1016/j.cor.2019.104865_bib0019) 1984; vol. 31 Macedo (10.1016/j.cor.2019.104865_bib0020) 2016; 82 Loparic (10.1016/j.cor.2019.104865_bib0018) 2001; 89 Ahn (10.1016/j.cor.2019.104865_bib0001) 2011; 49 Kilic (10.1016/j.cor.2019.104865_bib0014) 2013; 46 Guide (10.1016/j.cor.2019.104865_bib0008) 2000; 18 Brandimarte (10.1016/j.cor.2019.104865_bib0002) 2006; 44 Denizel (10.1016/j.cor.2019.104865_bib0003) 2010; 57 Li (10.1016/j.cor.2019.104865_bib0017) 2009; 47 Naeem (10.1016/j.cor.2019.104865_bib0021) 2013 Jayaraman (10.1016/j.cor.2019.104865_bib0012) 2006; 44 Wang (10.1016/j.cor.2019.104865_bib0023) 2013; 51
References_xml	– volume: 49 start-page: 6729 year: 2011 end-page: 6748 ident: bib0001 article-title: Solution algorithms for dynamic lot-sizing in remanufacturing systems publication-title: Int. J. Prod. Res. – volume: 267 start-page: 1102 year: 2018 end-page: 1109 ident: bib0015 article-title: Heuristic policies for the stochastic economic lot sizing problem with remanufacturing under service level constraints publication-title: Eur. J. Oper. Res. – volume: 47 start-page: 3657 year: 2009 end-page: 3668 ident: bib0017 article-title: A stochastic dynamic programming based model for uncertain production planning of re-manufacturing system publication-title: Int. J. Prod. Res. – volume: 105 start-page: 55 year: 2006 end-page: 84 ident: bib0007 article-title: A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem publication-title: Math. Program. – volume: 23 start-page: 419 year: 2012 end-page: 435 ident: bib0016 article-title: Production planning and control for remanufacturing: literature review and analysis publication-title: Prod. Plann. Control – year: 2006 ident: bib0022 article-title: Production Planning by Mixed Integer Programming – volume: 89 start-page: 487 year: 2001 end-page: 504 ident: bib0018 article-title: The uncapacitated lot-sizing problem with sales and safety stocks publication-title: Math. Program. – volume: 51 start-page: 2414 year: 2013 end-page: 2432 ident: bib0023 article-title: A two-stage robust programming approach to demand-driven disassembly planning for a closed-loop supply chain system publication-title: Int. J. Prod. Res. – volume: 68 start-page: 851 year: 2017 end-page: 878 ident: bib0005 article-title: A stochastic production planning problem in hybrid manufacturing and remanufacturing systems with resource capacity planning publication-title: J. Global Optim. – volume: 46 start-page: 742 year: 2013 end-page: 747 ident: bib0014 article-title: A mip-based heuristic for the stochastic economic lot sizing problem with remanufacturing publication-title: IFAC Proc. Vol. – volume: 38 start-page: 849 year: 2016 end-page: 876 ident: bib0010 article-title: Capacitated dynamic production and remanufacturing planning under demand and return uncertainty publication-title: OR spectrum – volume: 36 start-page: 7 year: 2008 end-page: 13 ident: bib0004 article-title: Lot-sizing on a tree publication-title: Oper. Res. Lett. – volume: 44 start-page: 981 year: 2006 end-page: 998 ident: bib0012 article-title: Production planning for closed-loop supply chains with product recovery and reuse: an analytical approach publication-title: Int. J. Prod. Res. – volume: vol. 31 year: 1984 ident: bib0019 article-title: Remanufacturing: The Experience of the United States and Implications for Developing Countries – volume: 91 start-page: 563 year: 2010 end-page: 591 ident: bib0011 article-title: Environmentally conscious manufacturing and product recovery (ECMPRO): a review of the state of the art publication-title: J. Environ. Manage. – volume: 57 start-page: 287 year: 2009 end-page: 298 ident: bib0006 article-title: Cutting planes for multistage stochastic integer programs publication-title: Oper. Res. – volume: 44 start-page: 2997 year: 2006 end-page: 3022 ident: bib0002 article-title: Multi-item capacitated lot-sizing with demand uncertainty publication-title: Int. J. Prod. Res. – volume: 57 start-page: 394 year: 2010 end-page: 404 ident: bib0003 article-title: Multiperiod remanufacturing planning with uncertain quality of inputs publication-title: IEEE Trans. Eng. Manage. – start-page: 1 year: 2013 end-page: 12 ident: bib0021 article-title: Production planning optimization for manufacturing and remanufacturing system in stochastic environment publication-title: J. Intell. Manuf. – volume: 60 start-page: 1317 year: 2014 end-page: 1333 ident: bib0024 article-title: A branch-and-cut method for dynamic decision making under joint chance constraints publication-title: Manage. Sci. – volume: 82 start-page: 1241 year: 2016 end-page: 1257 ident: bib0020 article-title: Hybrid manufacturing and remanufacturing lot-sizing problem with stochastic demand, return, and setup costs publication-title: Int. J. Adv. Manuf. Technol. – volume: 18 start-page: 467 year: 2000 end-page: 483 ident: bib0008 article-title: Production planning and control for remanufacturing: industry practice and research needs publication-title: J. Oper. Manage. – volume: 15 start-page: 221 year: 1999 end-page: 230 ident: bib0009 article-title: Production planning and control for remanufacturing: a state-of-the-art survey publication-title: Rob. Comput. Integr. Manuf. – volume: 48 start-page: 4701 year: 2010 end-page: 4723 ident: bib0013 article-title: A multi-stage stochastic programming approach for production planning with uncertainty in the quality of raw materials and demand publication-title: Int. J. Prod. Res. – volume: 57 start-page: 394 issue: 3 year: 2010 ident: 10.1016/j.cor.2019.104865_bib0003 article-title: Multiperiod remanufacturing planning with uncertain quality of inputs publication-title: IEEE Trans. Eng. Manage. doi: 10.1109/TEM.2009.2024506 – volume: 18 start-page: 467 issue: 4 year: 2000 ident: 10.1016/j.cor.2019.104865_bib0008 article-title: Production planning and control for remanufacturing: industry practice and research needs publication-title: J. Oper. Manage. doi: 10.1016/S0272-6963(00)00034-6 – volume: 46 start-page: 742 issue: 9 year: 2013 ident: 10.1016/j.cor.2019.104865_bib0014 article-title: A mip-based heuristic for the stochastic economic lot sizing problem with remanufacturing publication-title: IFAC Proc. Vol. doi: 10.3182/20130619-3-RU-3018.00554 – volume: vol. 31 year: 1984 ident: 10.1016/j.cor.2019.104865_bib0019 – volume: 60 start-page: 1317 issue: 5 year: 2014 ident: 10.1016/j.cor.2019.104865_bib0024 article-title: A branch-and-cut method for dynamic decision making under joint chance constraints publication-title: Manage. Sci. doi: 10.1287/mnsc.2013.1822 – year: 2006 ident: 10.1016/j.cor.2019.104865_bib0022 – volume: 15 start-page: 221 issue: 3 year: 1999 ident: 10.1016/j.cor.2019.104865_bib0009 article-title: Production planning and control for remanufacturing: a state-of-the-art survey publication-title: Rob. Comput. Integr. Manuf. doi: 10.1016/S0736-5845(99)00020-4 – volume: 44 start-page: 981 issue: 5 year: 2006 ident: 10.1016/j.cor.2019.104865_bib0012 article-title: Production planning for closed-loop supply chains with product recovery and reuse: an analytical approach publication-title: Int. J. Prod. Res. doi: 10.1080/00207540500250507 – volume: 82 start-page: 1241 issue: 5–8 year: 2016 ident: 10.1016/j.cor.2019.104865_bib0020 article-title: Hybrid manufacturing and remanufacturing lot-sizing problem with stochastic demand, return, and setup costs publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-015-7445-z – volume: 91 start-page: 563 issue: 3 year: 2010 ident: 10.1016/j.cor.2019.104865_bib0011 article-title: Environmentally conscious manufacturing and product recovery (ECMPRO): a review of the state of the art publication-title: J. Environ. Manage. doi: 10.1016/j.jenvman.2009.09.037 – volume: 48 start-page: 4701 issue: 16 year: 2010 ident: 10.1016/j.cor.2019.104865_bib0013 article-title: A multi-stage stochastic programming approach for production planning with uncertainty in the quality of raw materials and demand publication-title: Int. J. Prod. Res. doi: 10.1080/00207540903055727 – volume: 23 start-page: 419 issue: 6 year: 2012 ident: 10.1016/j.cor.2019.104865_bib0016 article-title: Production planning and control for remanufacturing: literature review and analysis publication-title: Prod. Plann. Control doi: 10.1080/09537287.2011.561815 – volume: 57 start-page: 287 issue: 2 year: 2009 ident: 10.1016/j.cor.2019.104865_bib0006 article-title: Cutting planes for multistage stochastic integer programs publication-title: Oper. Res. doi: 10.1287/opre.1080.0535 – volume: 51 start-page: 2414 issue: 8 year: 2013 ident: 10.1016/j.cor.2019.104865_bib0023 article-title: A two-stage robust programming approach to demand-driven disassembly planning for a closed-loop supply chain system publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2012.737940 – volume: 89 start-page: 487 issue: 3 year: 2001 ident: 10.1016/j.cor.2019.104865_bib0018 article-title: The uncapacitated lot-sizing problem with sales and safety stocks publication-title: Math. Program. doi: 10.1007/PL00011411 – volume: 49 start-page: 6729 issue: 22 year: 2011 ident: 10.1016/j.cor.2019.104865_bib0001 article-title: Solution algorithms for dynamic lot-sizing in remanufacturing systems publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2010.535038 – volume: 105 start-page: 55 issue: 1 year: 2006 ident: 10.1016/j.cor.2019.104865_bib0007 article-title: A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem publication-title: Math. Program. doi: 10.1007/s10107-005-0572-9 – volume: 44 start-page: 2997 issue: 15 year: 2006 ident: 10.1016/j.cor.2019.104865_bib0002 article-title: Multi-item capacitated lot-sizing with demand uncertainty publication-title: Int. J. Prod. Res. doi: 10.1080/00207540500435116 – volume: 267 start-page: 1102 issue: 3 year: 2018 ident: 10.1016/j.cor.2019.104865_bib0015 article-title: Heuristic policies for the stochastic economic lot sizing problem with remanufacturing under service level constraints publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2017.12.041 – volume: 68 start-page: 851 issue: 4 year: 2017 ident: 10.1016/j.cor.2019.104865_bib0005 article-title: A stochastic production planning problem in hybrid manufacturing and remanufacturing systems with resource capacity planning publication-title: J. Global Optim. doi: 10.1007/s10898-017-0500-6 – volume: 38 start-page: 849 issue: 4 year: 2016 ident: 10.1016/j.cor.2019.104865_bib0010 article-title: Capacitated dynamic production and remanufacturing planning under demand and return uncertainty publication-title: OR spectrum doi: 10.1007/s00291-016-0441-3 – volume: 47 start-page: 3657 issue: 13 year: 2009 ident: 10.1016/j.cor.2019.104865_bib0017 article-title: A stochastic dynamic programming based model for uncertain production planning of re-manufacturing system publication-title: Int. J. Prod. Res. doi: 10.1080/00207540701837029 – volume: 36 start-page: 7 issue: 1 year: 2008 ident: 10.1016/j.cor.2019.104865_bib0004 article-title: Lot-sizing on a tree publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2007.04.007 – start-page: 1 year: 2013 ident: 10.1016/j.cor.2019.104865_bib0021 article-title: Production planning optimization for manufacturing and remanufacturing system in stochastic environment publication-title: J. Intell. Manuf.
SSID	ssj0000721
Score	2.4564636
Snippet	•We study a multi-echelon stochastic lot-sizing problem within remanufacturing environment.•It is modelled as a multi-stage stochastic integer program and... We consider an uncapacitated multi-item multi-echelon lot-sizing problem within a remanufacturing system involving three production echelons: disassembly,...
SourceID	hal proquest crossref elsevier
SourceType	Open Access Repository Aggregation Database Enrichment Source Index Database Publisher
StartPage	104865
SubjectTerms	Algorithms Branch-and-cut algorithm Computer Science Computer simulation Horizon Inequalities Integer programming Integers Lost sales Lot sizing Multi-stage stochastic integer programming Operations Research Optimization Production scheduling Refurbishment Remanufacturing Remanufacturing system Scenario tree Stochastic lot-sizing Valid inequalities
Title	A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales
URI	https://dx.doi.org/10.1016/j.cor.2019.104865 https://www.proquest.com/docview/2369316597 https://hal.science/hal-02470310
Volume	116
WOSCitedRecordID	wos000515443800007&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-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLa6DSF44FJAFAayEE-goCTOxX6spqFx0cTUgfoWuY69ZipJ1bRVtd_DD-U4ttOsiAmQeIkqq47Tfl98ju3vnIPQa8JDldCIeYSriRflkwReKeV7fp4TDqQKKTXFJtLTUzoesy-93g8XC7OepWVJNxs2_69QQxuArUNn_wLu9qbQAJ8BdLgC7HD9I-CHRiTogdt3odPHVmLKdTJmkxlCLpwk63sTnmhTihsxpe0ptToUWDGrll5dXJl49abujNm2XUiwU6VJ7jyr6uXbGqxM3XVzXa2IumFWNZcLq7izuYXaPeizlbziOXcutKhaPVAhwGI1-9NH5jB_1lEAfJI5z71RkU8rU6d5xFXRGphvK7M0gOc-W1n2242N0O_oYZrdNhdxs5U3NVFeWmwYm-yc76SZtGlKvDSJx9dmdRPC-YuFMJsVlwCwzgYbMH3ITU25ip3E2yM9lh4KfFw9FaZ76CBMYwZz58Hww_H449bip018X_ts7vS80RHuDPQ7_2dvqoW4O_5A4-ScP0D37OoEDw2rHqKeLPvotguO6KP7DlhsbUIf3e1ktHyENkPcYR_esg9b9uEO-7BjHwb2YY6vsQ9v2Yct-7BmH7bsw8A-rNmHG_Y9Rl_fH58fnXi2uIcnIhItPViHy1TJgOWETBLGRZxE_iSksAJRiseKJ0yEgkUB14v6OMhFzGjgJ1RIkSZKkSdov6xK-RThhIEXJhQNAkJgttEFEgT38zAXsF6ZUH-AfPeXZ8JmvtcFWGaZkzheZoBSplHKDEoD9KbtMjdpX276cuRwzKzfavzRDEh3U7dXgHl7e53n_WT4OdNt4DjruhL-OhigQ0eJzE4ydRYS-MlBErP02b8N_Rzd2b5xh2h_uVjJF-iWWC-LevHS0vsnpybUFg
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=A+multi-stage+stochastic+integer+programming+approach+for+a+multi-echelon+lot-sizing+problem+with+returns+and+lost+sales&rft.jtitle=Computers+%26+operations+research&rft.au=Quezada%2C+Franco&rft.au=Gicquel%2C+C%C3%A9line&rft.au=Kedad-Sidhoum%2C+Safia&rft.au=Vu%2C+Dong+Quan&rft.date=2020-04-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.eissn=1873-765X&rft.volume=116&rft_id=info:doi/10.1016%2Fj.cor.2019.104865&rft.externalDocID=S0305054819303077
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon