Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints
From MaRDI portal
Publication:3706490
DOI10.1287/opre.33.6.1360zbMath0583.68011OpenAlexW2018268918MaRDI QIDQ3706490
Publication date: 1985
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.33.6.1360
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items