We consider the problem of scheduling operations in bufferless robotic cells that produce identical parts. The objective is to find a cyclic sequence of robot moves that minimizes the long-run average time to produce a part or, equivalently, maximizes the throughput rate. The robot can be moved...

This paper analyzes the trade-off between (demand) substitution costs and (production) changeover costs in a discrete-time production-inventory setting using a two-product dynamic lot-sizing model with changeover, inventory carrying, and substitution costs. We first show that the problem is...

Motivated by the recent success of integer programming based procedures for computing discrete forecast horizons, we consider two-product variants of the classical dynamic lot-size model. In the first variant, we impose a warehouse capacity constraint on the total ending inventory of the two...

We present structural and computational investigations of a new class of weak forecast horizons - minimal forecast horizons under the assumption that future demands are integer multiples of a given positive real number - for a specific class of dynamic lot-size (DLS) problems. Apart from being...