IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v35y2018i2d10.1007_s10878-017-0180-7.html
   My bibliography  Save this article

Online lazy bureaucrat scheduling with a machine deadline

Author

Listed:
  • Ling Gai

    (Shanghai University)

  • Guochuan Zhang

    (Zhejiang University)

Abstract

The lazy bureaucrat scheduling problem was first introduced by Arkin et al. (Inf Comput 184:129–146, 2003). Since then, a number of variants have been addressed. However, very little is known on the online version. In this note we focus on the scenario of online scheduling, in which the jobs arrive over time. The bureaucrat (machine) has a working time interval. Namely, he has a deadline by which all scheduled jobs must be completed. A decision is only based on released jobs without any information on the future. We consider two objective functions of [min-makespan] and [min-time-spent]. Both admit best possible online algorithms with competitive ratio of $$\frac{\sqrt{5}+1}{2}\approx 1.618$$ 5 + 1 2 ≈ 1.618 .

Suggested Citation

  • Ling Gai & Guochuan Zhang, 2018. "Online lazy bureaucrat scheduling with a machine deadline," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 530-537, February.
    • Handle: RePEc:spr:jcomop:v:35:y:2018:i:2:d:10.1007_s10878-017-0180-7
    DOI: 10.1007/s10878-017-0180-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0180-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-017-0180-7?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.

    References listed on IDEAS

    as
    1. Ling Gai & Guochuan Zhang, 2008. "On lazy bureaucrat scheduling with common deadlines," Journal of Combinatorial Optimization, Springer, vol. 15(2), pages 191-199, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Furini, Fabio & Ljubić, Ivana & Sinnl, Markus, 2017. "An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem," European Journal of Operational Research, Elsevier, vol. 262(2), pages 438-448.
    2. Laurent Gourvès & Jérôme Monnot & Lydia Tlilane, 2018. "Subset sum problems with digraph constraints," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 937-964, October.

    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:35:y:2018:i:2:d:10.1007_s10878-017-0180-7. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.