On-line scheduling of parallel jobs in a list
type: Item
instance of: scholarly article
title: On-line scheduling of parallel jobs in a list
zbMATH Open document ID: 1153.90441
author: Deshi Ye
author: Guochuan Zhang
published in: Journal of Scheduling
publication date: 2008-11-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5363517
zbMATH Keywords: on-line scheduling
zbMATH Keywords: parallel computing
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: s10951-007-0032-x
OpenAlex ID: W1995217454
cites work: Orthogonal Packings in Two Dimensions
cites work: Shelf Algorithms for Two-Dimensional Packing Problems
cites work: On-line scheduling of parallel jobs with runtime restrictions
cites work: Lower bounds for on-line two-dimensional packing algorithms
cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: Scheduling multiprocessor tasks -- An overview
cites work: Complexity of Scheduling Parallel Task Systems
cites work: Optimal on-line scheduling of parallel jobs with dependencies
cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints
cites work: Scheduling parallel jobs to minimize the makespan
cites work: Q4335207
cites work: On an on-line scheduling problem for parallel jobs
cites work: A Strip-Packing Algorithm with Absolute Performance Bound 2
DOI: 10.1007/S10951-007-0032-X
description: scientific article; zbMATH DE number 5363517