Advertisement

Journal of Combinatorial Optimization

, Volume 35, Issue 2, pp 530–537 | Cite as

Online lazy bureaucrat scheduling with a machine deadline

Article
  • 64 Downloads

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

Keywords

Online algorithm Competitive ratio Lazy bureaucrat scheduling 

Notes

Acknowledgements

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

References

  1. Arkin EM, Bender MA, Mitchell JSB, Skiena SS (2003) The lazy bureaucrat scheduling problem. Inf Comput 184:129–146MathSciNetCrossRefMATHGoogle Scholar
  2. 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–139MathSciNetCrossRefMATHGoogle Scholar
  3. Epstein L, Levy M (2005) Online interval coloring and variants. In: ICALP, Lecture notes in computer science, vol 3580, pp 602–613Google Scholar
  4. Esfahbod B, Ghodsi M, Sharifi A (2003) Common-deadline lazy bureaucrat scheduling problems. In: WADS, Lecture notes in computer science, vol 2748, pp 59–66Google Scholar
  5. Gai L, Zhang G (2008) On lazy bureaucrat scheduling with common deadlines. J Comb Optim 15:191–199MathSciNetCrossRefMATHGoogle Scholar
  6. Gai L, Zhang G (2009) Hardness of lazy packing and covering. Oper Res Lett 37:89–92MathSciNetCrossRefMATHGoogle Scholar
  7. 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–182Google Scholar
  8. Gourvès L, Monnot J, Pagourtzis AT (2014) The lazy matroid problem. Proc IFIP TCS 8705:66–77MathSciNetMATHGoogle Scholar
  9. Hepner C, Stein C (2002) Minimizing makespan for the lazy bureaucrat problem. In: SWAT, Lecture notes in computer science, vol 2368, pp 40–50Google Scholar
  10. 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–6Google Scholar
  11. Lin M, Yang Y, Xu J (2010a) On lazy bin covering and packing problems. Theor Comput Sci 411:277–284CrossRefMATHGoogle Scholar
  12. Lin M, Yang Y, Xu J (2010b) Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems. Algorithmica 57:232–251MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.School of ManagementShanghai UniversityShanghaiChina
  2. 2.College of Computer ScienceZhejiang UniversityHangzhouChina

Personalised recommendations