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

Two-dimensional Gantt charts and a scheduling algorithm of Lawler

Author

Listed:
  • GOEMANS, Michel X.

    (Center for Operations Research and Econometrics (CORE), Université catholique de Louvain (UCL), Louvain la Neuve, Belgium)

  • WILLIAMSON, David P.

    (IBM T.J. Watson Research Center, Yorktown Heights, New York)

Abstract

In this note we give an alternate proof that a scheduling algorithm of Lawler [3,4] finds the optimal solution for 1 / prec / SIGMAj wj Cj when the precedence constraints are series-parallel. We do this by using a linear programming formulation of 1 / prec / SIGMAj wj Cj introduced by Queyranne and Wang [10]. Queyranne and Wang proved that their formulation completely describes the scheduling polyhedron in the case of series-parallel constraints; a by-product of our proof of correctness of Lawler’s algorithm is an alternate proof of this fact. In the course of our proof it is helpful to use what might be called two-dimensional Gantt charts. We think these may find independent use, and to illustrate this we show that some recent work in the area becomes transparent using 2D Gantt charts

Suggested Citation

  • GOEMANS, Michel X. & WILLIAMSON, David P., 1998. "Two-dimensional Gantt charts and a scheduling algorithm of Lawler," LIDAM Discussion Papers CORE 1998001, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvco:1998001
    as

    Download full text from publisher

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

    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:cor:louvco:1998001. 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.