首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
Authors:Mathieu Van Vyve
Institution:(1) Center of Operations Research and Econometrics (CORE), Université catholique de Louvain. 34, voie du Roman Pays, 1348 Louvain-la-Neuve, Belgium
Abstract:Recently, several authors 8, 10] have argued for the use of extended formulations to tighten production planning models. In this work we present two linear-programming extended formulations of the constant-capacity lot-sizing problem with backlogging. The first one applies to the problem with a general cost function and has O(n3) variables and constraints. This improves on the more straightforward O(n4) Florian and Klein 2] type formulation. The second one applies when the costs satisfy the Wagner-Whitin property but it has O(n2) variables and O(n3) constraints. As a by-product, we positively answer an open question of Miller and Wolsey 4] about the tightness of an extended formulation for the continuous mixing set. This text presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Minister's Office, Science Policy Programming. The research was carried out with financial support of the Growth Project G1RD-1999-00034 (LISCOS) of the European Community. The scientific responsibility is assumed by the author.
Keywords:Lot-sizing  Constant capacity  Backlogging  Extended formulation
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号