Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/76133
Type: Artigo de periódico
Title: A network flow model for the capacitated lot-sizing problem
Author: Armentano, VA
Franca, PM
de Toledo, FMB
Abstract: The lot-sizing problem considered in this paper consists in planning the production of multiple items on a single machine over a finite planning horizon divided into time periods. The objective of the problem is to determine a minimum cost production plan that meets the forecast demand for the items. The mathematical model considers setup time and setup cost, and is represented as a minimum cost network how problem. A branch-and-bound method is proposed for solving the model.:The performance of the method is evaluated by using numerical experiments for various demand patterns and values of cost parameters. (C) 1999 Elsevier Science Ltd. All rights reserved.
Subject: production planning
lot-sizing
network flows
branch-and-bound
setup time
Country: Inglaterra
Editor: Pergamon-elsevier Science Ltd
Rights: fechado
Identifier DOI: 10.1016/S0305-0483(98)00045-0
Date Issue: 1999
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000079155800010.pdf190.75 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.