A note on ‘scheduling mixed-model multi-level just-in-time production systems’

Miltenburg and Sinnamon (see abstract 43930) give a method for efficiently finding good production schedules in mixed-model multi-level just-in-time production systems. They first formulate the problem as a quadratic programming problem. Their formulation leaves out a constraint that is necessary for feasibility. They then present two heuristics to find good production schedules without solving the quadratic programming problem. Their heuristics do not include feasibility checks for production decisions. As a result, they can produce infeasible production schedules. A modification of their formulation and their heuristics is presented which does guarantee a feasible solution. [Also see abstract 58503.]