Deterministic Scheduling with Pipelined Processors
From MaRDI portal
Publication:3868759
DOI10.1109/TC.1980.1675569zbMath0431.68044OpenAlexW1977580236MaRDI QIDQ3868759
John W. Jones III, Kimming So, John L. 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
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)
Related Items (7)
Computing the bump number with techniques from two-processor scheduling ⋮ Polynomial-time approximation schemes for scheduling problems with time lags ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ A metric approach for scheduling problems with minimizing the maximum penalty ⋮ Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. ⋮ Minimizing the makespan in a two-machine cross-docking flow shop problem ⋮ On scheduling cycle shops: Classification, complexity and approximation
This page was built for publication: Deterministic Scheduling with Pipelined Processors
