IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v83y1998i0p271-28710.1023-a1018916215399.html
   My bibliography  Save this article

Decomposition in single-machine scheduling

Author

Listed:
  • Wlodzimierz Szwarc

Abstract

This paper discusses the recent research on decomposition techniques in single-machine scheduling. A variety of orderings between adjacent and nonadjacent jobs in an optimal scheduling are presented. A list of decomposition rules is given that enable one to solve large size instances of six single-machine models. A partition technique is also developed to determine the optimal completion times of a general earliness-tardiness model for a given arrangement of jobs. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Wlodzimierz Szwarc, 1998. "Decomposition in single-machine scheduling," Annals of Operations Research, Springer, vol. 83(0), pages 271-287, October.
    • Handle: RePEc:spr:annopr:v:83:y:1998:i:0:p:271-287:10.1023/a:1018916215399
    DOI: 10.1023/A:1018916215399
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018916215399
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018916215399?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Koulamas, Christos, 2010. "The single-machine total tardiness scheduling problem: Review and extensions," European Journal of Operational Research, Elsevier, vol. 202(1), pages 1-7, April.
    2. Nikhil Bansal & Christoph Dürr & Nguyen Kim Thang & Óscar C. Vásquez, 2017. "The local–global conjecture for scheduling with non-linear cost," Journal of Scheduling, Springer, vol. 20(3), pages 239-254, June.

    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:spr:annopr:v:83:y:1998:i:0:p:271-287:10.1023/a:1018916215399. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.