An approximation algorithm for scheduling on three dedicated machines
type: Item
instance of: scholarly article
title: An approximation algorithm for scheduling on three dedicated machines
zbMATH Open document ID: 0831.68006
DOI: 10.1016/0166-218X(94)00160-F
author: Michel X. Goemans
published in: Discrete Applied Mathematics
publication date: 1995-08-27T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 790502
zbMATH Keywords: scheduling problem
MaRDI profile type: Publication
cites work: Nonpreemptive scheduling of independent tasks with prespecified processor allocations
cites work: Scheduling multiprocessor tasks on three dedicated processors
cites work: Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors''
cites work: Scheduling File Transfers
cites work: Complexity of scheduling multiprocessor tasks with prespecified processors allocations
cites work: The complexity of scheduling independent two-processor tasks on dedicated processors
cites work: Multiprocessor scheduling with communication delays
Wikidata QID: Q127673845
description: scientific article; zbMATH DE number 790502