Scheduling unit-time jobs on processors with different capabilities

DOI10.1016/0305-0548(89)90029-4zbMath0674.90051OpenAlexW2043741523MaRDI QIDQ1121780

S. H. Smith

Publication date: 1989

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(89)90029-4

zbMATH Keywords

parallel processorsmultiprocessor systembalanced assignmentunit execution-time jobs

Mathematics Subject Classification ID

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

Related Items

Scheduling with constrained processor allocation for interval orders ⋮ UET-scheduling with constrained processor allocations ⋮ On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems ⋮ Scheduling multiprocessor tasks -- An overview

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing mean weighted execution time loss on identical and uniform processors
• On a scheduling problem where a job can be executed only by a limited number of processors
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Fast Algorithms for Bipartite Network Flow
• Algorithms for Scheduling Tasks on Unrelated Processors
• Optimal Preemptive Scheduling of Two Unrelated Processors
• Network Flow and Testing Graph Connectivity
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey