Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays

DOI10.1134/S0005117910100085zbMath1218.93059MaRDI QIDQ612215

Aleksei V. Fishkin, R. A. Sitters, Sergey Sevast'janov

Publication date: 3 January 2011

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

complexityapproximation algorithmNP-hard\(m\) identical parallel machinesscheduling of \(n\) independent jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Automated systems (robots, etc.) in control theory (93C85)

Related Items (1)

On the Sitters-Fishkin hypothesis

Cites Work

• Unnamed Item
• Unnamed Item
• Three, four, five, six, or the complexity of scheduling with communication delays
• Time bounds for selection
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• Scheduling trees with large communication delays on two identical processors
• Scheduling with Deadlines and Loss Functions
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays

This page was built for publication: Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays