Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
type: Item
instance of: scholarly article
title: Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
zbMATH Open document ID: 0912.90175
DOI: 10.1016/S0167-6377(97)00053-9
author: Enyu Yao
author: Guohui Lin
author: Yong He
published in: Operations Research Letters
publication date: 1999-02-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1223282
zbMATH Keywords: multiprocessor scheduling
zbMATH Keywords: approximation
zbMATH Keywords: matching
zbMATH Keywords: LPT
zbMATH Keywords: generalized version
zbMATH Keywords: classical parallel machine scheduling
zbMATH Keywords: minimum machine completion time
zbMATH Keywords: weighting function
zbMATH Keywords: worst-case performance ratio
MaRDI profile type: Publication
cites work: The exact LPT-bound for maximizing the minimum completion time
cites work: Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
cites work: Q4198056
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Q4388434
cites work: Parallel machines scheduling with nonsimultaneous machine available time
full work available at URL: s0167-6377(97)00053-9
OpenAlex ID: W2046677007
description: scientific article; zbMATH DE number 1223282