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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Wagner, H., & Whitin, T. (1958). Dynamic version of the economic lot size model. Management Science, 5, 89–96.
Tonelli, F., Paolucci, M., Anghinolfi, D., & Taticchi, P. (2013). Production planning of mixed-model assembly lines: a heuristic mixed integer programming based approach. Production Planning & Control, 24, 110–127.
Almada-Lobo, B., & James, R. (2010). Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups. International Journal Of Production Research, 48, 861–878.
Karimi, B., Ghomi, S., & Wilson, J. (2003). The capacitated lot sizing problem: a review of models and algorithms. Omega, 31, 365–378.
Drexl, A., & Kimms, A. (1997). Lot sizing and scheduling-survey and extensions. European Journal Of Operational Research, 99, 221–235.
Maravelias, C., & Sung, C. (2009). Integration of production planning and scheduling: Overview, challenges and opportunities. Computers & Chemical Engineering, 33, 1919–1930.
Copil, K., Wörbelauer, M., Meyr, H., & Tempelmeier, H. (2016). Simultaneous lotsizing and scheduling problems: A classification and review of models. OR Spectrum, 1–64.
Bitran, G., & Yanasse, H. (1982). Computational complexity of the capacitated lot size problem. Management Science, 28, 1174–1186.
Gupta, D., & Magnusson, T. (2005). The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Computers & Operations Research, 32, 727–747.
Clark, A., & Clark, S. (2000). Rolling-horizon lot-sizing when set-up times are sequence-dependent. International Journal of Production Research, 38, 2287–2307.
Haase, K., & Kimms, A. (2000). Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. International Journal of Production Economics, 66, 159–169.
Almada-Lobo, B., Klabjan, D., Antónia Carravilla, M., & Oliveira, J. (2007). Single machine multi-product capacitated lot sizing with sequence-dependent setups. International Journal of Production Research, 45, 4873–4894.
Guimarães, L., Klabjan, D., & Almada-Lobo, B. (2014). Modeling lotsizing and scheduling problems with sequence dependent setups. European Journal of Operational Research, 239, 644–662.
Teunter, R., Bayindir, Z., & Heuvel, W. (2006). Dynamic lot sizing with product returns and remanufacturing. International Journal of Production Research, 44, 4377–4400.
Giglio, D., Paolucci, M., & Roshani, A. (2017). Integrated lot sizing and energy-efficient job shop scheduling problem in manufacturing/remanufacturing systems. Journal of Cleaner Production, 148, 624–641.
Shrouf, F., & Miragliotta, G. (2015). Energy management based on internet of things: Practices and framework for adoption in production management. Journal of Cleaner Production, 100, 235–246.
May, G., Stahl, B., Taisch, M., & Prabhu, V. (2015). Multi-objective genetic algorithm for energy-efficient job shop scheduling. International Journal of Production Research, 53, 7071–7089.
Stadtler, H. (2003). Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Operations Research, 51, 487–502.
Gómez Urrutia, E., Aggoune, R., & Dauzère-Pérès, S. (2014). Solving the integrated lot-sizing and job-shop scheduling problem. International Journal of Production Research, 52, 5236–5254.
Mirjalili, S., Mirjalili, S., & Lewis, A. (2014). Grey wolf optimizer. Advances In Engineering Software, 69, 46–61.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that there is no conflict of interest regarding the publication of this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Roshani, A., Paolucci, M., Giglio, D. et al. 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, 469–505 (2023). https://doi.org/10.1007/s10479-022-04783-4
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-022-04783-4