Skip to main content

Multi-product Lot-Sizing Problem with Remanufacturing, Lost Sales and Sequence-Dependent Changeover Cost

  • Conference paper
  • First Online:
Computational Logistics (ICCL 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14239))

Included in the following conference series:

  • 513 Accesses

Abstract

This work studies a lot-sizing problem motivated by a textile remanufacturing company in Chile. In particular, we investigate a multi-product lot-sizing with remanufacturing, lost sales, and sequence-dependent changeover costs. The problem is first formulated as a mixed-integer linear program. Then, we adapted a known family of valid inequalities and proposed a new exponential family of valid inequalities taking advantage of the problem structure. We use them in a branch-and-cut algorithm to solve the problem. The preliminary numerical results show the proposed inequalities’ usefulness in strengthening the proposed formulation’s linear relaxation and show that the method outperforms the generic branch-and-cut algorithm embedded in a stand-alone mathematical solver.

This research was partially supported by Dicyt projects 062217QV and 062217DG, Vicerrectoría de Investigación, Desarrollo e Innovación, Universidad de Santiago de Chile.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aishah, S., Ali, S., Ali, F., Talib, M.L., Rozita, W., Din, W.: Valid inequalities for the capacitated lot-sizing problem in a hybrid manufacturing and remanufacturing system (2021)

    Google Scholar 

  2. Akartunalı, K., Arulselvan, A.: Economic lot-sizing problem with remanufacturing option: complexity and algorithms. In: Pardalos, P.M., Conca, P., Giuffrida, G., Nicosia, G. (eds.) MOD 2016. LNCS, vol. 10122, pp. 132–143. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-51469-7_11

    Chapter  Google Scholar 

  3. Ali, S.A.S., Doostmohammadi, M., Akartunalı, K., van der Meer, R.: A theoretical and computational analysis of lot-sizing in remanufacturing with separate setups. Int. J. Prod. Econ. 203, 276–285 (2018)

    Article  Google Scholar 

  4. Brahimi, N., Absi, N., Dauzère-Pérès, S., Nordli, A.: Single-item dynamic lot-sizing problems: an updated survey. Eur. J. Oper. Res. 263(3), 838–863 (2017)

    Article  Google Scholar 

  5. Cunha, J.O., Konstantaras, I., Melo, R.A., Sifaleras, A.: On multi-item economic lot-sizing with remanufacturing and uncapacitated production. Appl. Math. Model. 50, 772–780 (2017)

    Article  Google Scholar 

  6. Goerler, A., Lalla-Ruiz, E., Voß, S.: Late acceptance hill-climbing matheuristic for the general lot sizing and scheduling problem with rich constraints. Algorithms 13(6), 138 (2020)

    Article  Google Scholar 

  7. Goerler, A., Voß, S.: Dynamic lot-sizing with rework of defective items and minimum lot-size constraints. Int. J. Prod. Res. 54(8), 2284–2297 (2016)

    Article  Google Scholar 

  8. Guan, Y., Ahmed, S., Nemhauser, G.L.: Cutting planes for multistage stochastic integer programs. Oper. Res. 57(2), 287–298 (2009)

    Article  Google Scholar 

  9. Loparic, M., Pochet, Y., Wolsey, L.A.: The uncapacitated lot-sizing problem with sales and safety stocks. Math. Program. 89(3), 487–504 (2001)

    Article  Google Scholar 

  10. Pochet, Y., Wolsey, L.A.: Polyhedra for lot-sizing with wagner-whitin costs. Math. Program. 67(1), 297–323 (1994)

    Article  Google Scholar 

  11. Quezada, F., Gicquel, C., Kedad-Sidhoum, S.: New valid inequalities for a multi-echelon multi-item lot-sizing problem with returns and lost sales. In: Mes, M., Lalla-Ruiz, E., Voß, S. (eds.) ICCL 2021. LNCS, vol. 13004, pp. 192–207. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-87672-2_13

    Chapter  Google Scholar 

  12. Quezada, F., Gicquel, C., Kedad-Sidhoum, S., Vu, D.Q.: A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales. Comput. Oper. Res. 116, 104865 (2020)

    Article  Google Scholar 

  13. Retel Helmrich, M.J., Jans, R., van den Heuvel, W., Wagelmans, A.P.: Economic lot-sizing with remanufacturing: complexity and efficient formulations. IIE Trans. 46(1), 67–86 (2014)

    Article  Google Scholar 

  14. Roshani, A., Paolucci, M., Giglio, D., Demartini, M., Tonelli, F., Dulebenets, M.A.: The capacitated lot-sizing and energy efficient single machine scheduling problem with sequence dependent setup times and costs in a closed-loop supply chain network. Ann. Oper. Res. 321(1–2), 469–505 (2023)

    Article  Google Scholar 

  15. Suzanne, E., Absi, N., Borodin, V.: Towards circular economy in production planning: challenges and opportunities. Eur. J. Oper. Res. 287(1), 168–190 (2020)

    Article  Google Scholar 

  16. Torkaman, S., Ghomi, S.F., Karimi, B.: Multi-stage multi-product multi-period production planning with sequence-dependent setups in closed-loop supply chain. Comput. Ind. Eng. 113, 602–613 (2017)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Franco Quezada .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gana, L., Dávila-Gálvez, S., Quezada, F. (2023). Multi-product Lot-Sizing Problem with Remanufacturing, Lost Sales and Sequence-Dependent Changeover Cost. In: Daduna, J.R., Liedtke, G., Shi, X., Voß, S. (eds) Computational Logistics. ICCL 2023. Lecture Notes in Computer Science, vol 14239. Springer, Cham. https://doi.org/10.1007/978-3-031-43612-3_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-43612-3_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-43611-6

  • Online ISBN: 978-3-031-43612-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics