Online lazy bureaucrat scheduling with a machine deadline

DOI10.1007/S10878-017-0180-7zbMATH Open1393.90054OpenAlexW2767169079MaRDI QIDQ1702835FDOQ1702835

Authors: Ling Gai, Guochuan 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

Recommendations

• Algorithms and Data Structures
• On lazy bureaucrat scheduling with common deadlines
• scientific article; zbMATH DE number 2185608
• Common Deadline Lazy Bureaucrat Scheduling Revisited
• The lazy bureaucrat scheduling problem

zbMATH Keywords

competitive ratioonline algorithmlazy bureaucrat scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Automata, Languages and Programming
• The lazy bureaucrat scheduling problem
• Title not available (Why is that?)
• The maximum resource bin packing problem
• Hardness of lazy packing and covering
• On lazy bin covering and packing problems
• Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
• On lazy bureaucrat scheduling with common deadlines
• The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design
• The Lazy Matroid Problem
• Algorithms and Data Structures

Cited In (5)

• Common Deadline Lazy Bureaucrat Scheduling Revisited
• Online work-break problem and its competitive analysis
• Aggressive online deadline scheduling
• Algorithms and Data Structures
• Title not available (Why is that?)

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

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