Scheduling unit-time jobs on processors with different capabilities
type: Item
instance of: scholarly article
title: Scheduling unit-time jobs on processors with different capabilities
zbMATH Open document ID: 0674.90051
DOI: 10.1016/0305-0548(89)90029-4
author: S. H. Smith
published in: Computers \& Operations Research
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 4104700
zbMATH Keywords: multiprocessor system
zbMATH Keywords: unit execution-time jobs
zbMATH Keywords: parallel processors
zbMATH Keywords: balanced assignment
MaRDI profile type: Publication
full work available at URL: 0305-0548(89)90029-4
OpenAlex ID: W2043741523
cites work: On a scheduling problem where a job can be executed only by a limited number of processors
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q4133147
cites work: Minimizing mean weighted execution time loss on identical and uniform processors
cites work: Algorithms for Scheduling Tasks on Unrelated Processors
cites work: Optimal Preemptive Scheduling of Two Unrelated Processors
cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
cites work: Q4058442
cites work: Fast Algorithms for Bipartite Network Flow
cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks
cites work: Q4739657
cites work: Network Flow and Testing Graph Connectivity
description: scientific article; zbMATH DE number 4104700