In this paper, the capacitated lot-sizing and scheduling problem with sequence dependent setup times and costs in a closed loop supply chain is addressed. The system utilizes the closed-loop supply chain strategy so that the multi-class single-level products are produced through both manufacturing of raw materials and remanufacturing of returned recovered products. In this system, a single machine with a limited capacity in each time period is used to perform both the manufacturing and remanufacturing operations. The sequence-dependent setup times and costs (both between two lots of products of different classes and between two lots belonging to the same class of products produced through different methods) are considered. A large-bucket mixed integer programming formulation is proposed for the problem. This model minimizes not only the manufacturing and remanufacturing costs, the setup costs and the inventory holding and backlogging costs over the planning horizon, but also the energy costs paid for the utilization of machine and the compression of processing times. Since the problem is NP-hard, a matheuristic and a grey wolf optimization algorithm are proposed to solve it. To evaluate the efficiency of the proposed algorithm, some experimental instances are generated and solved. The obtained results show the effectiveness of the proposed algorithms.

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

Paolucci, Massimo;Giglio, Davide;Demartini, Melissa;Tonelli, Flavio;
2022

Abstract

In this paper, the capacitated lot-sizing and scheduling problem with sequence dependent setup times and costs in a closed loop supply chain is addressed. The system utilizes the closed-loop supply chain strategy so that the multi-class single-level products are produced through both manufacturing of raw materials and remanufacturing of returned recovered products. In this system, a single machine with a limited capacity in each time period is used to perform both the manufacturing and remanufacturing operations. The sequence-dependent setup times and costs (both between two lots of products of different classes and between two lots belonging to the same class of products produced through different methods) are considered. A large-bucket mixed integer programming formulation is proposed for the problem. This model minimizes not only the manufacturing and remanufacturing costs, the setup costs and the inventory holding and backlogging costs over the planning horizon, but also the energy costs paid for the utilization of machine and the compression of processing times. Since the problem is NP-hard, a matheuristic and a grey wolf optimization algorithm are proposed to solve it. To evaluate the efficiency of the proposed algorithm, some experimental instances are generated and solved. The obtained results show the effectiveness of the proposed algorithms.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11567/1088128
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact