scientific article
From MaRDI portal
Publication:3046476
zbMath1078.90530MaRDI QIDQ3046476
Publication date: 12 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2368/23680040.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
Scheduling algorithms for procrastinators ⋮ An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem ⋮ The lazy bureaucrat scheduling problem ⋮ On lazy bureaucrat scheduling with common deadlines ⋮ Online lazy bureaucrat scheduling with a machine deadline