Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines|
|Abstract:||This paper addresses the capacitated lot-sizing problem involving the production of multiple items on unrelated parallel machines. A production plan should be determined in order to meet the forecast demand for the items, without exceeding the capacity of the machines and minimize the sum of production, setup and inventory costs. A heuristic based on the Lagrangian relaxation of the capacity constraints and subgradient optimization is proposed. Initially, the heuristic is tested on instances of the single machine problem and results are compared with heuristics from the literature. For parallel machines and small problems the heuristic performance is tested against optimal solutions, and for larger problems it is compared with the lower bound provided by the Lagrangian relaxation. (c) 2005 Elsevier B.V. All rights reserved.|
|Editor:||Elsevier Science Bv|
|Citation:||European Journal Of Operational Research. Elsevier Science Bv, v. 175, n. 2, n. 1070, n. 1083, 2006.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.