A linear compound algorithm for uniform machine scheduling
type: Item
instance of: scholarly article
title: A linear compound algorithm for uniform machine scheduling
zbMATH Open document ID: 0909.90173
DOI: 10.1007/BF02684446
author: Rainer E. Burkard
author: Yong He
author: Hans Kellerer
published in: Computing
publication date: 1999-03-16T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1199874
zbMATH Keywords: two uniform machine scheduling
zbMATH Keywords: worst-case bound
MaRDI profile type: Publication
cites work: A note on MULTIFIT scheduling for uniform machines
cites work: Analysis of a Compound Bin Packing Algorithm
cites work: Bounds for LPT Schedules on Uniform Processors
cites work: Q4526868
cites work: A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors
cites work: Joint performance of greedy heuristics for the integer knapsack problem
cites work: Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
cites work: A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
full work available at URL: https://doi.org/10.1007/bf02684446
OpenAlex ID: W1997535791
description: scientific article; zbMATH DE number 1199874