Dynamic work hour optimization for casual workers
- 36 Downloads
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.
KeywordsWork hour optimization Work-break problem Online algorithm Competitive analysis
Mathematics Subject Classification68W27 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.
- 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
- 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
- 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
- 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
- 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
- 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