This paper tackles a generalization of the weight constrained shortest path problem in a directed network (WCSPP) in which replenishment arcs, that reset the accumulated weight along the path to zero, appear in the network. Such situations arise, for example, in airline crew pairing applications, where the weight represents duty hours, and replenishment arcs represent crew overnight rests, and ...

This study explores the problem of optimally dynamic joint decisions: replenishment quantity, retail price and depletion time, in a vertically decentralized single-retailer and single-supplier supply chain over a dynamic multi-period planning horizon, subject to multivariate demand function and deteriorating goods with shortages allowed and with no consideration of fixed costs. This research us...

T his study analyzes optimal replenishment policies that minimize expected discounted cost of multi-product stochastic inventory systems. The distinguishing feature of the multi-product inventory system that we analyze is the existence of correlated demand and joint-replenishment costs across multiple products. Our objective is to understand the structure of the optimal policy and use this stru...

We study a joint inventory and pricing problem in a single-stage system with a positive lead time. We consider both additive and multiplicative demand forms. This problem is, in general, intractable due to its computational complexity. We develop a simple heuristic that resolves this issue. The heuristic involves a myopic pricing policy that generates each period’s price as a function of the in...

In this paper we present two models for joint stock replenishment and shipment consolidation decisions which arise in the context of vendor managed inventory. Stock replenishment from suppliers or shipment to customers each incurs a lump-sum cost to the vendor. We assume the vendor uses the reorder point, lot-size policy to replenish stock and one of two schemes to dispatch shipment: the time-b...