Staggering Periodic Replenishment in Multivendor JIT Environments

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...

Full description

Saved in:
Bibliographic Details
Main Authors: HUM, Sin-Hoon, MOOSA, Sharafali, TEO, Chung-Piaw
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2005
Subjects:
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/884
https://doi.org/10.1287/opre.1040.0196
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.lkcsb_research-1883
record_format dspace
spelling sg-smu-ink.lkcsb_research-18832016-01-06T15:30:58Z Staggering Periodic Replenishment in Multivendor JIT Environments HUM, Sin-Hoon MOOSA, Sharafali TEO, Chung-Piaw 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. [PUBLICATION ABSTRACT] 2005-08-01T07:00:00Z text https://ink.library.smu.edu.sg/lkcsb_research/884 info:doi/10.1287/opre.1040.0196 https://doi.org/10.1287/opre.1040.0196 Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Operations and Supply Chain Management Operations Research, Systems Engineering and Industrial Engineering
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Operations and Supply Chain Management
Operations Research, Systems Engineering and Industrial Engineering
spellingShingle Operations and Supply Chain Management
Operations Research, Systems Engineering and Industrial Engineering
HUM, Sin-Hoon
MOOSA, Sharafali
TEO, Chung-Piaw
Staggering Periodic Replenishment in Multivendor JIT Environments
description 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. [PUBLICATION ABSTRACT]
format text
author HUM, Sin-Hoon
MOOSA, Sharafali
TEO, Chung-Piaw
author_facet HUM, Sin-Hoon
MOOSA, Sharafali
TEO, Chung-Piaw
author_sort HUM, Sin-Hoon
title Staggering Periodic Replenishment in Multivendor JIT Environments
title_short Staggering Periodic Replenishment in Multivendor JIT Environments
title_full Staggering Periodic Replenishment in Multivendor JIT Environments
title_fullStr Staggering Periodic Replenishment in Multivendor JIT Environments
title_full_unstemmed Staggering Periodic Replenishment in Multivendor JIT Environments
title_sort staggering periodic replenishment in multivendor jit environments
publisher Institutional Knowledge at Singapore Management University
publishDate 2005
url https://ink.library.smu.edu.sg/lkcsb_research/884
https://doi.org/10.1287/opre.1040.0196
_version_ 1770569724670771200