An LSTM network-based genetic algorithm for integrated procurement and scheduling optimisation
Modern supply chains are characterised by high complexity, requiring effective management through coordinated activities across interrelated functions. This study aims to move from isolated optimisation to integrated decision-making, which offers new potential for efficiency. We investigate an integ...
Saved in:
| Published in | International journal of production research Vol. 63; no. 11; pp. 4036 - 4065 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | English |
| Published |
Taylor & Francis
03.06.2025
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0020-7543 1366-588X 1366-588X |
| DOI | 10.1080/00207543.2024.2434948 |
Cover
| Summary: | Modern supply chains are characterised by high complexity, requiring effective management through coordinated activities across interrelated functions. This study aims to move from isolated optimisation to integrated decision-making, which offers new potential for efficiency. We investigate an integrated procurement-production problem based on a real case study from a German company specialising in printed circuit board assembly. We propose a novel solution approach that combines a genetic algorithm with a neural network to increase computational efficiency. Our comprehensive evaluation scheme demonstrates the viability of the approach in generating integrated decisions within a limited time frame. Specifically, we quantify the benefits of integrated over separated decision-making at the operational level, extending previous research focussed on the tactical level. The results indicate considerable benefits of integrated decision-making across a wide range of cost factors, although the exact savings depend on specific cost parameters. In addition, we evaluate our model on a rolling horizon planning basis, which is crucial for modelling realistic supply chain behaviour and remains underrepresented in the literature. |
|---|---|
| ISSN: | 0020-7543 1366-588X 1366-588X |
| DOI: | 10.1080/00207543.2024.2434948 |