Single-processor scheduling with time restrictions

DOI10.1007/s10951-013-0342-0zbMath1305.68041OpenAlexW2137203481MaRDI QIDQ490336

Ronald L. Graham, Fan R. K. Chung, Oliver Braun

Publication date: 22 January 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-013-0342-0

zbMATH Keywords

worst-case analysistime restrictionssingle-processor scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions, On the NP-hardness of scheduling with time restrictions, On the minimum number of resources for a perfect schedule, EPTAS for parallel identical machine scheduling with time restrictions, Better permutations for the single-processor scheduling with time restrictions, The single-processor scheduling problem with time restrictions: complexity and related problems

Cites Work

• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Unnamed Item
• Unnamed Item