A quadratic model for production-inventory planning was made famous by Holt, Modigliani, Muth, and Simon in 1960 in [3], especially for its application to a paint factory. A discrete control version of a related quadratic production-inventory model was studied by Kleindorfer, Kriebel, Thompson,...

The widespread adoption of activity-based costing enables firms to allocate common service costs to each customer, allowing for precise measurement of both the cost to serve a particular customer and the customer's profitability. In this paper, we investigate how pricing strategies based on...

The academic and practitioner literature justifies firms' use of product costs in product pricing and capacity planning decisions as heuristics to address an otherwise intractable problem. However, product costs are the output of a cost reporting system, which itself is the outcome of heuristic...

We consider two classes of multi-item lot-sizing problems. The first is a class of single stage problems involving joint machine capacity constraints and/or start up costs, and the second is a class of multistage problems with general product structure. The problems are solved as mixed integer...

This paper develops a "perfect planning horizon procedure" for the simple cash balance problem, where the objective of the firm is to schedule the selling and buying of its earning assets so that all the positive demands are met at minimum cost. Demand for cash can be both positive or negative; a...

Economic lot sizing and batching models often assume reliable manufacturing facilities. In this research, we focus on the effects of machine breakdowns and corrective maintenance on the economic lot sizing decisions. Two production control policies are proposed for coping with these stochastic...

Consider a plant that has information about the arrival schedule of its "inputs" over a planning cycle. The plant has parallel production lines for processing multiple types of products. However, changeover cost and changeover time are incurred when a line changes from processing one type of...

The classical dynamic lot size problem without backlogging is in practice usually solved with the aid of various heuristics. Most heuristics are sequential techniques, i.e. the future demand is considered period for period, and a decision whether to have a set-up or not in a certain period is...

In this paper the Discrete Lotsizing and Scheduling Problem (DLSP) is considered. DLSP relates to capacitated lotsizing as well as to job scheduling problems and is concerned with determining a feasible production schedule with minimal total costs in a single-stage manufacturing process. This...

In spite of the remarkable improvements in the quality of general purpose mixed-integer programming software, the effective solution of a variety of lot-sizing problems depends crucially on the development of tight formulations for the special problem features occurring in practice. After...