Generating daily production schedules in process industries

摘要

We study the problem of generating daily production schedules in a two-stage production system that is typical of many processing industries. We first describe the problem as it occurs in practice, and then present an integer programming model that mmaximizes a weighted sum of the customer orders to be processed in a day's work when a priori production sequences are specified at some stations. Bounds on the optimal solution are obtained by a lagrangian relaxation, and two heuristic procedures are developed and tested empirically. We show how these procedures can be incorporated in an interactive solution scheme to generate good production schedules.