Relaxa？？o Lagrangiana aplicada ao problema de dimensionamento de lotes em máquinas paralelas: limitantes inferiores

this paper addresses the single stage lot-sizing problem in parallel machines. each item can be produced on any machine, and incurs a setup time before to start the production. the objective of this paper is to obtain lower bounds of good quality for this problem. a solution method is developed based on a reformulation of the problem and the lagrangian relaxation of a set of constraints. some computational results are presented comparing the proposed method with a method from the literature and with a computational package.