We present a heuristic for lot sizing in serial assembly systems with multiple contrained resources. This procedure, the Coefficient Modification Heuristic (CMH), exploits a special problem structure by solving repetitively a small linear programming restriction of the original problem. The key...

We introduce a heuristic method for finding good, feasible solutions for multiproduct lot sizing problems with general assembly structures, multiple constrained resources, and nonzero setup costs and setup times. We evaluate the performance of this heuristic by comparing its solutions to optimal...

We introduce a heuristic method for finding good feasible solutions for multi-product lot sizing problems with general assembly structures, multiple constrained resources, and non-zero setup costs and setup times. We evaluate the performance of this heuristic by comparing its solutions to...

We introduce a heuristic method for finding good, feasible solutions for multiproduct lot sizing problems with general assembly structures, multiple constrained resources, and nonzero setup costs and setup times. We evaluate the performance of this heuristic by comparing its solutions to optimal...