The integrated stochastic lot-sizing and job-shop scheduling problem in closed-loop supply chains

Milad Mohammadi

Journal of Management Analytics, 2025, vol. 12, issue 4, 882-905

Abstract: This research develops a mathematical model for the integrated lot-sizing and job-shop scheduling problem in which supplier selection and purchase lot-sizing are incorporated into the production lot-sizing problem. A Chance Constrained Programming (CCP) approach is applied to formulate them in a General Lot-sizing and Scheduling Problem (GLSP) model. Some numerical experiments are performed to evaluate the efficiency of the model’s results. The computational analysis indicates that when the production and purchase lot-sizing decisions are taken simultaneously, combined cost of production and purchase (and thus the total cost) is lower than when these decisions are made hierarchically. The average cost of the integrated model is 4.03% less than the non-integrated model. This improvement is mostly made in the purchase lot-sizing cost because through applying the integrated model, the company can recognize the best time of procuring materials from the best suppliers and use their discount schemes.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/23270012.2025.2472371 (text/html)
Access to full text is restricted to subscribers.

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:taf:tjmaxx:v:12:y:2025:i:4:p:882-905

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjma20

DOI: 10.1080/23270012.2025.2472371

Access Statistics for this article

Journal of Management Analytics is currently edited by Li Xu

More articles in Journal of Management Analytics from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().