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

The relation of time indexed formulations of single machine scheduling problems to the node packing problem

Author

Listed:
  • WATERER, Hamish
  • JOHNSON, Ellis
  • NOBILI, Paolo
  • SAVELSBERGH, Martin

Abstract

No abstract is available for this item.

Suggested Citation

  • WATERER, Hamish & JOHNSON, Ellis & NOBILI, Paolo & SAVELSBERGH, Martin, 2002. "The relation of time indexed formulations of single machine scheduling problems to the node packing problem," LIDAM Reprints CORE 1585, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  • Handle: RePEc:cor:louvrp:1585
    DOI: 10.1007/s10107-002-0335-9
    Note: In : Mathematical Programming, Serie A, 93, 477-494, 2002
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1007/s10107-002-0335-9
    Download Restriction: no

    File URL: https://libkey.io/10.1007/s10107-002-0335-9?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. Nurre, Sarah G. & Cavdaroglu, Burak & Mitchell, John E. & Sharkey, Thomas C. & Wallace, William A., 2012. "Restoring infrastructure systems: An integrated network design and scheduling (INDS) problem," European Journal of Operational Research, Elsevier, vol. 223(3), pages 794-806.
    2. Kovalyov, Mikhail Y. & Ng, C.T. & Cheng, T.C. Edwin, 2007. "Fixed interval scheduling: Models, applications, computational complexity and algorithms," European Journal of Operational Research, Elsevier, vol. 178(2), pages 331-342, April.
    3. Louis-Philippe Bigras & Michel Gamache & Gilles Savard, 2008. "Time-Indexed Formulations and the Total Weighted Tardiness Problem," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 133-142, February.
    4. Pasquale Avella & Maurizio Boccia & Bernardo D’Auria, 2005. "Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 183-191, May.
    5. Pasquale Avella & Maurizio Boccia & Carlo Mannino & Igor Vasilyev, 2017. "Time-Indexed Formulations for the Runway Scheduling Problem," Transportation Science, INFORMS, vol. 51(4), pages 1196-1209, November.
    6. Natashia Boland & Riley Clement & Hamish Waterer, 2016. "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 14-30, February.
    7. Laureano Escudero & Javier Salmeron, 2005. "On a Fix-and-Relax Framework for a Class of Project Scheduling Problems," Annals of Operations Research, Springer, vol. 140(1), pages 163-188, 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:cor:louvrp:1585. 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.