Preemptive Scheduling with Release Times, Deadlines, and Due Times
From MaRDI portal
Publication:3945580
DOI10.1145/322326.322337zbMath0485.68033OpenAlexW2043913312MaRDI QIDQ3945580
Publication date: 1982
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322326.322337
uniform machinesidentical machinespreemptive schedules for jobs with restricted availability on parallel processors
Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)
Related Items
Planning computations in a multiprocessor system with unfixed parameters ⋮ Strip packing with precedence constraints and strip packing with release times ⋮ Is a unit-job shop not easier than identical parallel machines? ⋮ Preemptive scheduling of independent jobs with release times and deadlines on a hypercube ⋮ Preemptive scheduling of two uniform parallel machines to minimize total tardiness ⋮ A competitive two-agent scheduling problem on parallel machines with release dates and preemption ⋮ 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 ⋮ Some algorithms for analysis and synthesis of real-time multiprocessor computing systems ⋮ Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph ⋮ A characterization of network representable polymatroids ⋮ A parallel algorithm of simulated annealing for multiprocessor scheduling ⋮ Synthesizing a multiprocessor system for scheduling with interruptions and execution intervals ⋮ Iterative scheduling algorithms based on the subdivision of the solution space into domains ⋮ Multicommodity flows and cuts in polymatroidal networks ⋮ On the optimality of the earliest due date rule in stochastic scheduling and in queueing ⋮ New directions in scheduling theory ⋮ Testing membership in matroid polyhedra ⋮ Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
