This paper considers a dynamic lot sizing problem faced by a producer who supplies a single product to multiple customers. Characterized by their backorder costs as well as shipping costs, a customer with a high backorder cost has a greater need for the product than a customer with a low...

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

This paper investigates the dynamic inventory model for the case when production in a period is restricted to a finite set of specified values. The model allows the production rate to be any value in the set {0, P, 2P, ..., mP}, where m is a nonnegative integer. It is assumed that the setup cost...

This paper considers the production planning problem of a firm that produces a single product using a process that has multiple production lines (or machines) in parallel, each with a finite production capacity. Specifically, the firm has m parallel production lines, each with capacity of P...

This paper considers the dynamic lot sizing problem of H. M. Wagner and T. M. Whitin with the assumption that the total cost of n setups is a concave nondecreasing function of n. Such setup costs could arise from the worker learning in setups and/or technological improvements in setup methods....

We are concerned with a discrete-time undiscounted dynamic lot size model m which demand and cost parameters are constant for an initial few periods. As our main result, we obtain an upper bound on the number of these periods which guarantees the optimality of the Economic Order Quantity (EOQ)...

This paper develops a forward algorithm and planning horizon procedures for an important machine replacement model where it is assumed that the technological environment is improving over time and that the machine-in-use can be replaced by any of the several different kinds of machines available...