Preprint Article Version 3 Preserved in Portico This version is not peer-reviewed

A Simulation Based Solution Approach for the Capacitated Lot-Sizing Problem With Remanufacturing

Version 1 : Received: 11 April 2023 / Approved: 12 April 2023 / Online: 12 April 2023 (04:55:56 CEST)
Version 2 : Received: 19 April 2023 / Approved: 20 April 2023 / Online: 20 April 2023 (05:21:25 CEST)
Version 3 : Received: 21 April 2023 / Approved: 21 April 2023 / Online: 21 April 2023 (09:46:54 CEST)

How to cite: Rocha, L. A Simulation Based Solution Approach for the Capacitated Lot-Sizing Problem With Remanufacturing. Preprints 2023, 2023040242. https://doi.org/10.20944/preprints202304.0242.v3 Rocha, L. A Simulation Based Solution Approach for the Capacitated Lot-Sizing Problem With Remanufacturing. Preprints 2023, 2023040242. https://doi.org/10.20944/preprints202304.0242.v3

Abstract

We present a new model formulation for a class of capacitated lot-sizing problem considering setup costs, product returns, and remanufacturing (CLSP-RM). We investigate a broad class of instances that fall into two groups, in the first group we can reformulate the problem with a relaxation and test whether the original problem is solvable. The relaxation gives near optimal solutions and the solution of this class does not give any difficulty to known solvers such as Cplex, Gurobi or Xpress. The second group of instances are of category NP and will be solved with a simple period-by-period simulation

Keywords

simulation based optimization; capacitated lot-sizing problem; heuristics; remanufacturing

Subject

Computer Science and Mathematics, Computational Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.