Preemptive scheduling of independent jobs with release times and deadlines on a hypercube

DOI10.1016/0020-0190(90)90096-GzbMath0695.68030OpenAlexW1986275683MaRDI QIDQ910210

Jürgen Plehn

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90096-g

zbMATH Keywords

hypercubedeadlinesrelease timespreemptive scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Related Items

Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Deadline scheduling of multiprocessor tasks, Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness, Scheduling multiprocessor tasks -- An overview

Cites Work

• A new polynomial-time algorithm for linear programming
• Preemptive scheduling of independent jobs on a hypercube
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Preemptive Scheduling with Release Times, Deadlines, and Due Times
• Some simple scheduling algorithms