An LPT-bound for a parallel multiprocessor scheduling problem
type: Item
instance of: scholarly article
title: An LPT-bound for a parallel multiprocessor scheduling problem
zbMATH Open document ID: 0842.90059
author: Farid Harche
author: Sridhar Seshadri
published in: Journal of Mathematical Analysis and Applications
publication date: 1996-06-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 861812
zbMATH Keywords: makespan
zbMATH Keywords: worst-case behavior
MaRDI profile type: Publication
full work available at URL: jmaa.1995.1405
OpenAlex ID: W1988087589
DOI: 10.1006/JMAA.1995.1405
Recommended article: Q3971305
Recommended article: A parallel approximation scheme for the multiprocessor scheduling problem
Recommended article: Q4388434
Recommended article: Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm
Recommended article: Parametric bounds for LPT scheduling on uniform processors
Recommended article: Q4427861
Recommended article: Performance of the LPT algorithm in multiprocessor scheduling
Recommended article: Q4221466
description: scientific article; zbMATH DE number 861812