Abstract This paper considers a combination of the joint replenishment problem with single machine scheduling. There is resource, which required by all unit-time jobs, and job can be started at time point t on if only does not process another , resource replenished between its release date . Each has cost, independent amount replenished. The objective to minimize total cost plus maximum flow jo...

• We characterize the optimal joint replenishment policy. propose a new, exact method to evaluate any Our vastly reduces state-space size when compared Markov approach. introduce generalized can-order policy and improve decomposition new stationary under compound Poisson demand. The makes use of an embedded chain that only considers state system after order is placed. resulting space reduction ...