Online work-break problem and its competitive analysis

DOI10.1142/S0217595916500111MaRDI QIDQ2809318zbMATH OpenFDO

Authors Xiaodong Ji, Weimin Ma

Publication date 27 May 2016

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

competitive analysisonline algorithmwork-break problem

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Theory of organizations, manpower planning in operations research (90B70)

Recommendations

• Dynamic work hour optimization for casual workers
• On-line scheduling with extendable working time on a small number of machines
• Online lazy bureaucrat scheduling with a machine deadline
• Online optimization of busy time on parallel machines. (Extended abstract)
• Online optimization of busy time on parallel machines

Cites work

• Competitive strategy for on-line leasing of depreciable equipment
• On the best possible competitive ratio for the multislope ski-rental problem
• Risk-reward models for on-line leasing of depreciable equipment
• Ski rental with two general options
• The ski-rental problem with multiple discount options

Cited in

(1)

• Dynamic work hour optimization for casual workers

This page was built for publication: Online work-break problem and its competitive analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809318)