IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v3y1999i4d10.1023_a1009875403874.html
   My bibliography  Save this article

Randomized Online Scheduling with Delivery Times

Author

Listed:
  • Steve Seiden

    (Max-Planck-Institut für Informatik, Im Stadtwald)

Abstract

We study one of the most basic online scheduling models, online one machine scheduling with delivery times where jobs arrive over time. We provide the first randomized algorithm for this model, show that it is 1.55370-competitive and show that this analysis is tight. The best possible deterministic algorithm is φ ≈ 1.61803-competitive. Our algorithm is a distribution between two deterministic algorithms. We show that any such algorithm is no better than 1.5-competitive. To our knowledge, this is the first lower bound proof for a distribution between two deterministic algorithms.

Suggested Citation

  • Steve Seiden, 1999. "Randomized Online Scheduling with Delivery Times," Journal of Combinatorial Optimization, Springer, vol. 3(4), pages 399-416, December.
    • Handle: RePEc:spr:jcomop:v:3:y:1999:i:4:d:10.1023_a:1009875403874
    DOI: 10.1023/A:1009875403874
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009875403874
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009875403874?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. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    2. Peihai Liu & Xiwen Lu, 2015. "Online scheduling on two parallel machines with release dates and delivery times," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 347-359, August.

    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:jcomop:v:3:y:1999:i:4:d:10.1023_a:1009875403874. 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.