Treffer: Integrated multi-plant collaborative production, inventory, and hub–spoke delivery of make-to-order products.

Title:
Integrated multi-plant collaborative production, inventory, and hub–spoke delivery of make-to-order products.
Authors:
Liu, Kefei1 (AUTHOR), Jiang, Zhibin1,2,3 (AUTHOR), Zhou, Liping2,3 (AUTHOR) zhoulp@sjtu.edu.cn
Source:
IISE Transactions. Jan2025, Vol. 57 Issue 1, p60-74. 15p.
Database:
Business Source Premier

Weitere Informationen

Motivated by make-to-order applications with committed delivery dates in a variety of industries, we investigate the integrated multi-plant collaborative production, inventory, and hub–spoke delivery problem in a complex production–distribution network. This network includes multi-location heterogeneous plants, distribution centers, and customers, for producing customized and splittable orders with one or more general-size multi-type jobs. Completed jobs are transported from plants to distribution centers, and then the orders whose all constituent jobs have arrived are delivered from distribution centers to customer sites. The objective is to make integrated scheduling decisions for production, inventory, and delivery, for minimizing total cost composed of production, transportation, tardiness, and inventory. We first formulate this problem as a mixed-integer programming model, and analyze its intractability by proving that the problem is NP-hard and no approximation algorithms exist with a constant worst-case ratio. We then reformulate this problem as a binary integer linear programming model to select a feasible schedule for each job, and propose a combined column generation and two-layer column enumeration algorithm to solve it. Through extensive numerical experiments, we demonstrate that our proposed algorithm is capable of generating optimal or near-optimal solutions expeditiously and outperforms four benchmark approaches, and gain valuable managerial insights for practitioners. [ABSTRACT FROM AUTHOR]

Copyright of IISE Transactions is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Volltext ist im Gastzugang nicht verfügbar.