Scheduling Independent Tasks with Due Times on a Uniform Processor System
From MaRDI portal
Publication:3930627
DOI10.1145/322203.322214zbMath0475.68013OpenAlexW2057412510MaRDI QIDQ3930627
Publication date: 1980
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322203.322214
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, A competitive two-agent scheduling problem on parallel machines with release dates and preemption, Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach, Preemptive scheduling on uniform parallel machines with controllable job processing times, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times, Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs