Scheduling on two identical machines with a speed-up resource

DOI10.1016/j.ipl.2011.05.022zbMath1260.68044OpenAlexW2023457745MaRDI QIDQ1944144

Deshi Ye, Lin Chen, Guo-Chuan Zhang, Hai-Feng Xu

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.05.022

zbMATH Keywords

schedulingonline algorithmsFPTAS

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (5)

ONLINE SCHEDULING OF MIXED CPU-GPU JOBS ⋮ An improved algorithm for parallel machine scheduling under additional resource constraints ⋮ Parallel machine scheduling with speed-up resources ⋮ Online Scheduling on a CPU-GPU Cluster ⋮ Parallel machine scheduling with additional resources: notation, classification, models and solution methods

Cites Work

• Machine scheduling with resource dependent processing times
• An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
• Scheduling jobs with time-resource tradeoff via nonlinear programming
• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• Scheduling parallel dedicated machines under a single non-shared resource
• Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
• Scheduling parallel dedicated machines with the speeding‐up resource
• Randomized on-line scheduling on two uniform machines

This page was built for publication: Scheduling on two identical machines with a speed-up resource