IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v19y1971i1p45-56.html
   My bibliography  Save this article

Dynamic Linear Programs for Production Scheduling

Author

Listed:
  • C. Roger Glassey

    (University of California, Berkeley, California)

Abstract

Deterministic linear scheduling problems can often be formulated as linear programs with staircase coefficient matrix structure in which the linking blocks are identity matrices, since the activities that link successive time periods represent storage of goods. The solution technique proposed in this paper can be viewed as a nested decomposition approach in which primal- as well as dual-variable information is transmitter between master and subproblems.

Suggested Citation

  • C. Roger Glassey, 1971. "Dynamic Linear Programs for Production Scheduling," Operations Research, INFORMS, vol. 19(1), pages 45-56, February.
    • Handle: RePEc:inm:oropre:v:19:y:1971:i:1:p:45-56
    DOI: 10.1287/opre.19.1.45
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.19.1.45
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.19.1.45?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Joseph B. Mazzola & William F. McCoy & Harvey M. Wagner, 1987. "Algorithms and heuristics for variable‐yield lot sizing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(1), pages 67-86, February.
    2. Thomas W. M. Vossen & R. Kevin Wood & Alexandra M. Newman, 2016. "Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing," Operations Research, INFORMS, vol. 64(4), pages 771-793, August.

    More about this item

    Statistics

    Access and download statistics

    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:inm:oropre:v:19:y:1971:i:1:p:45-56. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.