Journal of Combinatorial Optimization

, Volume 35, Issue 4, pp 1185–1201 | Cite as

Dynamic work hour optimization for casual workers

  • Weimin Ma
  • Wei Shao
  • Xiaodong Ji


An original online problem named the work-break problem is proposed to optimize the work hours of casual workers. The algorithm for our problem has to answer for a casual worker about when he should have a break for his efficiency declines with the growing duration of current work period. We consider the online uncertainty of the work efficiency and present a periodic algorithm for the problem. Then our algorithm is proved to be 2-competitive by a novel form of competitive analysis.


Work hour optimization Work-break problem Online algorithm Competitive analysis 

Mathematics Subject Classification

68W27 68Q25 



The work of this paper was partly supported by the National Natural Science Foundation of China (71071113), a Ph.D. Programs Foundation of Ministry of Education of China (20100072110011), and Fundamental Research Funds for the Central Universities.


  1. Ariely D, Wertenbroch K (2002) Procrastination, deadlines, and performance: self-control by precommitment. Psychol Sci 13(3):219–224CrossRefGoogle Scholar
  2. Barzel Y (1973) The determination of daily hours and wages. Q J Econ 87(2):220–238CrossRefGoogle Scholar
  3. Bell D, Otterbach S, Sousa-Poza A (2012) Work hours constraints and health. Ann Econ Stat 105(1):35–54CrossRefGoogle Scholar
  4. Chapman SJ (1909) Hours of labour. Econ J 19:353–373CrossRefGoogle Scholar
  5. El-Yaniv R, Kaniel R, Linial N (1999) Competitive optimal on-line leasing. Algorithmica 25(1):116–140CrossRefzbMATHGoogle Scholar
  6. Fleischer R (2001) On the bahncard problem. Theor Comput Sci 268(1):161–174MathSciNetCrossRefzbMATHGoogle Scholar
  7. Folkard S, Lombardi DA (2006) Modeling the impact of the components of long work hours on injuries and accidents. Am J Ind Med 49(11):953–963CrossRefGoogle Scholar
  8. Fujiwara H, Kitano T, Fujito T (2014) On the best possible competitive ratio for the multislope ski-rental problem. J Comb Optim 31(2):463–490MathSciNetCrossRefzbMATHGoogle Scholar
  9. Ioannides A, Mavroudeas S (2011) A model for the relationship between working time and the intensity of labour. Bull Polit Econ 5(2):111–127Google Scholar
  10. Karp RM (1992) On-line algorithms versus off-line algorithms: How much is it worth to know the future? In: Proceedings of the IFIP 12th world computer congress, pp 7–11Google Scholar
  11. Liu B, Xin CL, Kan SB (2011) Competitive analysis of online leasing problem with discount quotation. In: The 4th international workshop on advanced computational intelligence (IWACI), pp 629–634Google Scholar
  12. Lotker Z, Shamir BP, Rawitz D (2008) Ski rental with two general options. Inf Process Lett 108(6):365–368MathSciNetCrossRefzbMATHGoogle Scholar
  13. Lotker Z, Shamir BP, Rawitz D (2008) Rent lease or buy: randomized algorithms for multi-slope ski rental. In: Proceedings of the 25th annual symposium on theoretical aspects of computer science, pp 503–514Google Scholar
  14. Ma WM, Ji XD (2016) Online work-break problem and its competitive analysis. Asia Pac J Oper Res 33(2):1650011MathSciNetCrossRefzbMATHGoogle Scholar
  15. Ma WM, You J, Xu YF, Liu J, Wang KL (2002) On the on-line number of snacks problem. J Glob Optim 24(4):449–462MathSciNetCrossRefzbMATHGoogle Scholar
  16. Manasse M, McGeoch LA, Sleator D (1988) Competitive algorithms for on-line problems. In: Proceedings of the 20th annual ACM symposium on theory of computing, pp 322–333Google Scholar
  17. Philp B, Slater G, Harvie D (2005) Preferences, power, and the determination of working hours. J Econ Issues 39(1):75–90CrossRefGoogle Scholar
  18. Pierce JL, Newstrom JW (1980) Toward a conceptual clarification of employee responses to flexible working hours: a work adjustment approach. J Manag 6(2):117–134Google Scholar
  19. Robbins L (1929) The economic effects of variations of hours of labour. Econ J 39:25–40CrossRefGoogle Scholar
  20. Xu YF, Xu WJ, Li HY (2007) On the on-line rent-or-buy problem in probabilistic environments. J Glob Optim 38(1):1–20MathSciNetCrossRefzbMATHGoogle Scholar
  21. Yang XY, Zhang WG, Zhang Y, Xu WJ (2012) Optimal randomized algorithm for a generalized ski-rental with interest rate. Inf Process Lett 112(13):548–551MathSciNetCrossRefzbMATHGoogle Scholar
  22. Zhang GQ, Poon CK, Xu YF (2011) The ski-rental problem with multiple discount options. Inf Process Lett 111(18):903–906MathSciNetCrossRefzbMATHGoogle Scholar
  23. Zhang Y, Zhang WG, Xu WJ, Li HY (2011) A risk-reward model for the on-line leasing of depreciable equipment. Inf Process Lett 111(6):256–261MathSciNetCrossRefzbMATHGoogle Scholar
  24. Zheng FF, Zhang E, Xu YF, Hong WC (2012) Competitive analysis for make-to-order scheduling with reliable lead time quotation. J Comb Optim 27(1):182–198MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of Economics and ManagementTongji UniversityShanghaiChina
  2. 2.School of ManagementShanghai University of Engineering ScienceShanghaiChina

Personalised recommendations