Bret Wagner

A search heuristic for the sequence-dependent economic lot scheduling problem

Abstract Almost all of the research on the economic lot scheduling problem (ELSP) has assumed that setup times are sequence-independent even though sequence-dependent problems are common in practice. Furthermore, most of the solution approaches that have been developed solve for a single optimal schedule when in practice it is more important to provide managers with a range of schedules of different length and complexity. In this paper, we develop a heuristic procedure to solve the ELSP problem with sequence-dependent setups. The heuristic provides a range of solutions from which a manager can choose, which should prove useful in an actual stochastic production environment. We show that our heuristic can outperform Dobsons heuristic when the utilization is high and the sequence-dependent setup times and costs are significant.

The production of several items in a single facility with linearly changing demand rates

In this paper we extend the ELSP model to allow for linearly changing demand rates over a fixed planning horizon. This extension of the ELSP research provides a model that can be used in coordinating the production and marketing planning activities in a firm. The model allows the user to evaluate the impact of changes in product demand on production costs and customer service. We solve the model using a standard nonlinear programming package (MINOS) and show through examples based on actual production data how the model can be used to support coordinated production and marketing planning.