Preemptive Scheduling with Release Times, Deadlines, and Due Times

DOI10.1145/322326.322337MaRDI QIDQ3945580zbMATH OpenOpenAlexFDO

Authors Chip Martel

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

zbMATH Keywords

identical machinespreemptive schedules for jobs with restricted availability on parallel processorsuniform machines

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Deterministic network models in operations research (90B10)

Cited in

(21)

• Testing membership in matroid polyhedra
• Is a unit-job shop not easier than identical parallel machines?
• 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
• On the optimality of the earliest due date rule in stochastic scheduling and in queueing
• Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
• Synthesizing a multiprocessor system for scheduling with interruptions and execution intervals
• Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph
• Iterative scheduling algorithms based on the subdivision of the solution space into domains
• Planning computations in a multiprocessor system with unfixed parameters
• 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
• A characterization of network representable polymatroids
• Measuring the slack between lower bounds for scheduling on parallel machines
• Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete
• A parallel algorithm of simulated annealing for multiprocessor scheduling
• Submodular hypergraph partitioning: metric relaxations and fast algorithms via an improved cut-matching game
• New directions in scheduling theory
• Strip packing with precedence constraints and strip packing with release times
• Preemptive scheduling of independent jobs with release times and deadlines on a hypercube
• Preemptive scheduling on uniform parallel machines with controllable job processing times

This page was built for publication: Preemptive Scheduling with Release Times, Deadlines, and Due Times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3945580)