OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES

DOI10.1142/S0217595906000772zbMath1105.90024OpenAlexW2052257804MaRDI QIDQ3379505

Yiwei Jiang, Yong He

Publication date: 6 April 2006

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595906000772

zbMATH Keywords

schedulingcompetitive ratiouniform machinessemi-onlinepreemption

Mathematics Subject Classification ID

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

Cites Work

• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Preemptive on-line scheduling for two uniform processors
• Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
• Preemptive machine covering on parallel machines
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• A Level Algorithm for Preemptive Scheduling
• Preemptive Scheduling of Uniform Processor Systems
• Randomized on-line scheduling on two uniform machines

This page was built for publication: OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES