IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/2001006.html
   My bibliography  Save this paper

A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case

Author

Listed:
  • MILLER, Andrew J.
  • NEMHAUSER, George L.
  • SAVELSBERGH, Martin W.P.

Abstract

We study a special case of a structured mixed integer programming model that arises in a number of applications. For the most general case of the model, called PI, we have earlier analyzed the polyhedral structure (Miller et al. [2000a]), including identifying facet-defining valid inequalities. PI is N P-hard; in this paper we focus on a special case, called PIC, that is polynomially solvable. We describe a polynomial algorithm for PIC, and we then use this algorithm to derive an extended formulation of polynomial size for PIC. Projecting from this extended formulation onto the original space of variables, we show that the set of inequalities presented for PI in Miller et al. [2000a] is sufficient to enable us to solve the special case PIC by linear programming. Finally, for PIC, we describe fast combinatorial separation algorithms for these inequalities.

Suggested Citation

  • MILLER, Andrew J. & NEMHAUSER, George L. & SAVELSBERGH, Martin W.P., 2001. "A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case," LIDAM Discussion Papers CORE 2001006, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvco:2001006
    as

    Download full text from publisher

    File URL: https://sites.uclouvain.be/core/publications/coredp/coredp2001.html
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cor:louvco:2001006. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.