Please use this identifier to cite or link to this item:
|Title:||Staggering periodic replenishment in multivendor JIT environments|
|Authors:||Hum, S.-H. |
|Keywords:||Chinese remainder theorem|
|Source:||Hum, S.-H., Sharafali, M., Teo, C.-P. (2005). Staggering periodic replenishment in multivendor JIT environments. Operations Research 53 (4) : 698-710. ScholarBank@NUS Repository. https://doi.org/10.1287/opre.1040.0196|
|Abstract:||The delivery scheduling problem studied in this paper was motivated by the operation in a large personal computer assembly plant, which was using multisourcing for some of its materials. The company's objective was to design a delivery schedule so that the average inventory level in the factory was minimized. We show that the problem is intimately related to a classical inventory staggering problem, where the focus is on the computation of the peak inventory level associated with the replenishment policy. This connection allows us to show that the delivery scheduling problem is NP-hard. For the two-vendor case with integral replenishment intervals, we propose a generalized form of Homer's scheduling heuristic and obtain performance bounds for the classical inventory staggering problem. Our analysis uses the Chinese remainder theorem in an interesting way. The approach can be generalized to the case with more than two vendors, leading to a strong linear-programming-based lower bound for the inventory staggering problem. We illustrate this technique for the case in which all the replenishment intervals are relatively prime, establishing a bound that is not greater than 140% of the optimal. We examine the implications of these results to the delivery scheduling problem. © 2005 INFORMS.|
|Source Title:||Operations Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 6, 2017
WEB OF SCIENCETM
checked on Nov 20, 2017
checked on Dec 10, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.