scientific article; zbMATH DE number 2089207
From MaRDI portal
Publication:3046476
zbMATH Open1078.90530MaRDI QIDQ3046476FDOQ3046476
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
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Cited In (7)
- Scheduling algorithms for procrastinators
- The lazy bureaucrat scheduling problem
- On lazy bureaucrat scheduling with common deadlines
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
- ILP and CP formulations for the lazy bureaucrat problem
- Online lazy bureaucrat scheduling with a machine deadline
- Title not available (Why is that?)
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)