This note formulates an assignment problem for obtaining optimal level schedules for mixed-model assembly lines in JIT production systems. The problem was formulated as a quadratic integer programming problem in a recent paper by Miltenburg (1989) where, however, only enumerative algorithms and...

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

We present a classified bibliography of the literature in the area of forecast, solution, and rolling horizons primarily in operations management problems. Each one of over 200 selected papers is categorized on five dimensions that identify the horizon type, the model type (deterministic or...

We study a coordination contract for a supplier-retailer channel producing and selling a fashionable product exhibiting a stochastic price-dependent demand. The product's selling season is short, and the supply chain faces great demand uncertainty. We consider a scenario where the supplier...

Cooperative advertising is a key incentive offered by a manufacturer to influence retailers’ promotional decisions. We study cooperative advertising in a dynamic retail oligopoly where a manufacturer sells his product through N competing retailers. We model the problem as a Stackelberg...

We solve an agent's optimization problem of meeting demands for cash over time with cash deposited in bank or invested in stock. The stock pays dividends and uncertain capital gains, and a commission is incurred in buying and selling of stock. We use a stochastic maximum principle to obtain...

This paper develops efficient forward algorithms and planning horizon results for several machine replacement models under an improving technological environment over time. The models are that of cost minimization, profit maximization, and cost minimization with probabilistic breakdowns. The...