On-line Scheduling with Optimal Worst-Case Response Time

DOI10.1080/02522667.1995.10699242MaRDI QIDQ4718601zbMATH OpenOpenAlexFDO

Authors William F. Klostermeyer

Publication date 8 December 1996

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1995.10699242

zbMATH Keywords

distributed computer systemon-line algorithmscheduling independent processes

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1559529
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• An On-Line Algorithm for Some Uniform Processor Scheduling

Cites work

• Multiprocessor scheduling with interprocessor communication delays
• NP-complete scheduling problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• Upper bounds for static resource allocation in a distributed system

Cited in

(5)

• On-line resource management with application to routing and scheduling
• scientific article; zbMATH DE number 7051282 (Why is no real title available?)
• On-line scheduling with hard deadlines
• On robust online scheduling algorithms
• An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts

This page was built for publication: On-line Scheduling with Optimal Worst-Case Response Time

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