Online work-break problem and its competitive analysis
From MaRDI portal
Publication:2809318
DOI10.1142/S0217595916500111zbMATH Open1343.90045MaRDI QIDQ2809318FDOQ2809318
Authors: Xiaodong Ji, Weimin Ma
Publication date: 27 May 2016
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
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
Online algorithms; streaming algorithms (68W27) Theory of organizations, manpower planning in operations research (90B70)
Cites Work
Cited In (1)
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)