Hybrid methods for lot sizing on parallel machines
Lower bounds stronger than the ones obtained by the traditional decomposition. Hybrid algorithms combining Lagrangian relaxation and DantzigWolfe decomposition. Improved Lagrangian heuristic that obtains good upper bounds. Computational experiments showing the quality of the proposed methods.
hybrid methods lot sizing parallel machines lagrangian relaxation dantzigwolfe decomposition reformulation