Deterministic Scheduling with Pipelined Processors

DOI10.1109/TC.1980.1675569MaRDI QIDQ3868759zbMATH OpenOpenAlexFDO

Authors John W. Jones III, Kimming So, John Bruno

Publication date 1980

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1980.1675569

zbMATH Keywords

deadlinesmultiprocessorpipelined processorrelease timesscheduling algorithmstask system

Mathematics Subject Classification ID

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

Cited in

(9)

• Computing the bump number with techniques from two-processor scheduling
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• On scheduling cycle shops: Classification, complexity and approximation
• A metric approach for scheduling problems with minimizing the maximum penalty
• Minimizing the makespan in a two-machine cross-docking flow shop problem
• Polynomial-time approximation schemes for scheduling problems with time lags
• Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete
• Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
• Single machine scheduling with precedence constraints and bounded maximum delay value

This page was built for publication: Deterministic Scheduling with Pipelined Processors

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