A polyhedral study of the single-item lot-sizing problem with continuous start-up costs

In this work we consider the single-item single-machine lot-sizing problem with continuous start-up costs. A continuous start-up cost is generated in a period whenever there is a nonzero production in the period and the production capacity in the previous period is not saturated. This concept of sta...

Full description

Saved in:
Bibliographic Details
Published in:Electronic notes in discrete mathematics 2011-08, Vol.37, p.261-266
Main Authors: Escalante, Mariana S., Marenco, Javier L., del Carmen Varaldo, María
Format: Article
Language:English
Subjects:
continuous start-up
lot-sizing
polyhedral combinatorics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this work we consider the single-item single-machine lot-sizing problem with continuous start-up costs. A continuous start-up cost is generated in a period whenever there is a nonzero production in the period and the production capacity in the previous period is not saturated. This concept of start-up does not correspond to the standard (discrete) start-up considered in previous models, thus motivating a polyhedral study of this problem. We introduce a natural integer programming formulation for this problem, we study some general properties and facet-inducing inequalities of the associated polytope, and we state relationships with known lotsizing polytopes.
ISSN:1571-0653
1571-0653
DOI:10.1016/j.endm.2011.05.045