Skip to main content
SpringerLink
Log in

Online lazy bureaucrat scheduling with a machine deadline

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Arkin EM, Bender MA, Mitchell JSB, Skiena SS (2003) The lazy bureaucrat scheduling problem. Inf Comput 184:129–146

    Article  MathSciNet  MATH  Google Scholar 

  • Boyar J, Epstein L, Favrholdt LM, Kohrt JS, Larsen KS, Pedersen MM, Wøhlk S (2006) The maximum resource bin packing problem. Theor Comput Sci 362:127–139

    Article  MathSciNet  MATH  Google Scholar 

  • Epstein L, Levy M (2005) Online interval coloring and variants. In: ICALP, Lecture notes in computer science, vol 3580, pp 602–613

  • Esfahbod B, Ghodsi M, Sharifi A (2003) Common-deadline lazy bureaucrat scheduling problems. In: WADS, Lecture notes in computer science, vol 2748, pp 59–66

  • Gai L, Zhang G (2008) On lazy bureaucrat scheduling with common deadlines. J Comb Optim 15:191–199

    Article  MathSciNet  MATH  Google Scholar 

  • Gai L, Zhang G (2009) Hardness of lazy packing and covering. Oper Res Lett 37:89–92

    Article  MathSciNet  MATH  Google Scholar 

  • Gourvès L, Monnot J, Pagourtzis AT (2013) The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design. In: FCT, Lecture notes in computer science, vol 8070, pp 171–182

  • Gourvès L, Monnot J, Pagourtzis AT (2014) The lazy matroid problem. Proc IFIP TCS 8705:66–77

    MathSciNet  MATH  Google Scholar 

  • Hepner C, Stein C (2002) Minimizing makespan for the lazy bureaucrat problem. In: SWAT, Lecture notes in computer science, vol 2368, pp 40–50

  • Király T, Bernáth A, Végh L, Bajzik L, Kovács E, Bérczi K, Jüttner A, Jordán T (2011) Worst case bin packing for OTN electrical layer networks dimensioning. In: ICTON , pp 1–6

  • Lin M, Yang Y, Xu J (2010a) On lazy bin covering and packing problems. Theor Comput Sci 411:277–284

    Article  MATH  Google Scholar 

  • Lin M, Yang Y, Xu J (2010b) Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems. Algorithmica 57:232–251

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the anonymous reviewers for their valuable comments that help greatly improve the presentation of this paper.

Author information

Authors and Affiliations

  1. School of Management, Shanghai University, Shanghai, 200444, China

    Ling Gai

  2. College of Computer Science, Zhejiang University, Hangzhou, 310027, China

    Guochuan Zhang

Authors
  1. Ling Gai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guochuan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guochuan Zhang.

Additional information

Ling Gai: Research supported by NSFC (11201333); Guochuan Zhang: Research supported by NSFC (11271325).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gai, L., Zhang, G. Online lazy bureaucrat scheduling with a machine deadline. J Comb Optim 35, 530–537 (2018). https://doi.org/10.1007/s10878-017-0180-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-017-0180-7

Keywords

Search

Navigation