Minimizing makespan for the lazy bureaucrat problem
From MaRDI portal
(Redirected from Minimizing makespan for the lazy bureaucrat problem)
Recommendations
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
- The lazy bureaucrat scheduling problem
- ILP and CP formulations for the lazy bureaucrat problem
- Scheduling algorithms for procrastinators
This page was built for publication: Minimizing makespan for the lazy bureaucrat problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046476)