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

Abdolreza Roshani (), Massimo Paolucci (), Davide Giglio (), Melissa Demartini (), Flavio Tonelli () and Maxim A. Dulebenets ()
Additional contact information
Abdolreza Roshani: Surrey Business School
Massimo Paolucci: University of Genova
Davide Giglio: University of Genova
Melissa Demartini: University of Southern Denmark
Flavio Tonelli: University of Genova
Maxim A. Dulebenets: Florida A &M University-Florida State University

Annals of Operations Research, 2023, vol. 321, issue 1, No 18, 469-505

Abstract: 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.

Keywords: Capacitated dynamic lot sizing problem; Remanufacturing; Single machine scheduling; Energy-efficient scheduling; Relax-and-fix matheuristic; Grey Wolf optimization (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-022-04783-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:321:y:2023:i:1:d:10.1007_s10479-022-04783-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-022-04783-4

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().