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

Optimal Capacity Scheduling---II

Author

Listed:
  • Arthur F. Veinott

    (Stanford University, California)

  • Harvey M. Wagner

    (Stanford University, California)

Abstract

This paper is a continuation of the preceding article. When no special assumption is made about the cost coefficient c ij in the capacity scheduling model, it is necessary, as has been shown, to solve the problem by means of a transshipment linear programming model. But for a large class of real situations, the c ij can be described in terms of a specific mathematical function that leads to considerable simplifications in the solution algorithm. Here the algorithmic simplifications are explored in detail. The analysis of the capacity scheduling model is also extended to situations in which initial capacities exist, and an application of the model to the multicommodity warehousing problem is given.

Suggested Citation

  • Arthur F. Veinott & Harvey M. Wagner, 1962. "Optimal Capacity Scheduling---II," Operations Research, INFORMS, vol. 10(4), pages 533-546, August.
    • Handle: RePEc:inm:oropre:v:10:y:1962:i:4:p:533-546
    DOI: 10.1287/opre.10.4.533
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.10.4.533
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.10.4.533?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. Thomas A. Weber, 2017. "Optimal switching between cash-flow streams," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(3), pages 567-600, December.
    2. Arjan Akkermans & Gerhard Post & Marc Uetz, 2021. "Solving the shift and break design problem using integer linear programming," Annals of Operations Research, Springer, vol. 302(2), pages 341-362, July.
    3. Luca Di Gaspero & Johannes Gärtner & Guy Kortsarz & Nysret Musliu & Andrea Schaerf & Wolfgang Slany, 2007. "The minimum shift design problem," Annals of Operations Research, Springer, vol. 155(1), pages 79-105, November.

    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:10:y:1962:i:4:p:533-546. 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.