Heuristic Procedures for the Single Operation, Multi-Item Loading Problem

Abstract

This paper considers the planning of individual machine groups or work centers producing many different products such as components, subassemblies or assemblies. The deterministic multi-item lot size problem with limited capacity has attracted much attention during the past two decades but no efficient optimization techniques are available up to now. We therefore suggest an efficient heuristic which is an extension of the Eisenhut heuristic. The resulting production programs always adhere to the characteristics of the dominant schedules. Special attention is given to the characterization of these dominant schedules.