Simple algorithms for multiprocessor scheduling to meet deadlines

DOI10.1016/0020-0190(77)90015-1MaRDI QIDQ1248336zbMATH OpenOpenAlexFDO

Authors Jacek Blazewicz

Publication date 1977

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

Full work available at URL https://doi.org/10.1016/0020-0190(77)90015-1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Cites work

• scientific article; zbMATH DE number 3560745 (Why is no real title available?)
• Minimizing maximum lateness on one machine: computational experience and some applications
• On a Real-Time Scheduling Problem
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• Sequencing with due-dates and early start times to minimize maximum tardiness

Cited in

(4)

• Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
• Scheduling unit-time tasks with integer release times and deadlines
• Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
• Deadline scheduling of tasks with ready times and resource constraints

This page was built for publication: Simple algorithms for multiprocessor scheduling to meet deadlines

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