Common Deadline Lazy Bureaucrat Scheduling Revisited

DOI10.1007/11682462_48MaRDI QIDQ3525786zbMATH OpenOpenAlexFDO

Authors Ling Gai, Guochuan Zhang

Publication date 18 September 2008

Published in LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11682462_48

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Recommendations

• On lazy bureaucrat scheduling with common deadlines
• Algorithms and Data Structures
• The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design
• Online lazy bureaucrat scheduling with a machine deadline
• scientific article; zbMATH DE number 2185608

Cited in

(5)

• scientific article; zbMATH DE number 2089207 (Why is no real title available?)
• The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design
• On lazy bureaucrat scheduling with common deadlines
• Online lazy bureaucrat scheduling with a machine deadline
• Algorithms and Data Structures

This page was built for publication: Common Deadline Lazy Bureaucrat Scheduling Revisited

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