scientific article; zbMATH DE number 2089207

MaRDI QIDQ3046476zbMATH OpenFDO

Authors Clint Hepner, Clifford Stein

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2368/23680040.htm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

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

Cited in

(7)

• The lazy bureaucrat scheduling problem
• An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
• Online lazy bureaucrat scheduling with a machine deadline
• On lazy bureaucrat scheduling with common deadlines
• scientific article; zbMATH DE number 2185608 (Why is no real title available?)
• ILP and CP formulations for the lazy bureaucrat problem
• Scheduling algorithms for procrastinators

This page was built for publication:

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