Optimal multiprocessor task scheduling using dominance and equivalence relations
From MaRDI portal
Publication:1318466
DOI10.1016/0305-0548(94)90033-7zbMath0802.68017OpenAlexW2024790103MaRDI QIDQ1318466
Chung-Ping Chung, Hong-Chich Chou
Publication date: 11 December 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90033-7
Cites Work
- Unnamed Item
- Unnamed Item
- A state-of-the-art review of parallel-machine scheduling research
- Optimal scheduling for two-processor systems
- Scheduling expressions on a pipelined processor with a maximal delay of one cycle
- Worst Case Analysis of Two Scheduling Algorithms
- Optimal Scheduling Strategies in a Multiprocessor System
This page was built for publication: Optimal multiprocessor task scheduling using dominance and equivalence relations