Multi-item lot-sizing with joint set-up costs (Q1013968)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Multi-item lot-sizing with joint set-up costs
scientific article

    Statements

    Multi-item lot-sizing with joint set-up costs (English)
    0 references
    0 references
    0 references
    0 references
    24 April 2009
    0 references
    A multi-item lot-sizing problem is considered, in which a setup cost is incurred for each batch that may contain at most \(C\) various items. Under the assumption that the storage costs are non-negative, i.e., are non-speculative or Wagner-Whitin costs, and additionally satisfy the dominance condition, the problem is formulated as a compact linear program with \(O(mT^2)\) constraints, where \(m\) is the number of items and \(T\) is the number of periods. The problem therefore is polynomially solvable. The backlogging version of the problem is also considered and formulated as a mixed integer program. In the uncapacitated case a specially constructed relaxation is shown to solve the problem. The results of computational experiments that use standard MIP solvers are reported.
    0 references
    multi-item lot-sizing
    0 references
    joint set-up cost
    0 references
    convex hull
    0 references
    extended formulation
    0 references
    mixed integer programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references