Online lazy bureaucrat scheduling with a machine deadline

DOI10.1007/S10878-017-0180-7zbMath1393.90054OpenAlexW2767169079MaRDI QIDQ1702835

Ling Gai, Guo-Chuan Zhang

Publication date: 1 March 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0180-7

zbMATH Keywords

competitive ratioonline algorithmlazy bureaucrat scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Hardness of lazy packing and covering
• On lazy bin covering and packing problems
• The lazy bureaucrat scheduling problem
• Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
• On lazy bureaucrat scheduling with common deadlines
• The maximum resource bin packing problem
• The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design
• The Lazy Matroid Problem
• Automata, Languages and Programming
• Algorithms and Data Structures

This page was built for publication: Online lazy bureaucrat scheduling with a machine deadline