Non-preemptive scheduling to maximize the minimum global inter-completion time
type: Item
instance of: scholarly article
title: Non-preemptive scheduling to maximize the minimum global inter-completion time
zbMATH Open document ID: 1013.90059
DOI: 10.1016/S0005-1098(03)00028-1
author: Carlos C. Amaro
author: Sanjoy K. Baruah
author: Wolfgang A. Halang
author: Alexander D. Stoyenko
published in: Automatica
publication date: 2003-06-09T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1924699
zbMATH Keywords: real-time systems
zbMATH Keywords: non-preemptive scheduling
zbMATH Keywords: multiple processors
zbMATH Keywords: resource
zbMATH Keywords: allocation
zbMATH Keywords: load balancing
MaRDI profile type: Publication
cites work: Q4515625
cites work: New strategies for assigning real-time tasks to multiprocessor systems
cites work: Q4198056
cites work: Fast algorithms for bin packing
cites work: Multiprocessor Scheduling with the Aid of Network Flow Algorithms
full work available at URL: s0005-1098(03)00028-1
OpenAlex ID: W1989642324
description: scientific article; zbMATH DE number 1924699