A comment on scheduling on uniform machines under chain-type precedence constraints
type: Item
instance of: scholarly article
title: A comment on scheduling on uniform machines under chain-type precedence constraints
zbMATH Open document ID: 0955.90036
DOI: 10.1016/S0167-6377(99)00076-0
published in: Operations Research Letters
publication date: 2001-03-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1448751
zbMATH Keywords: approximation algorithm
zbMATH Keywords: worst-case analysis
zbMATH Keywords: scheduling
zbMATH Keywords: uniform machines
zbMATH Keywords: precedence constraints
zbMATH Keywords: makespan
author: Gerhard J. Woeginger
MaRDI profile type: Publication
cites work: Q3840373
cites work: Q5501837
cites work: Bounds for LPT Schedules on Uniform Processors
cites work: Q3995531
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Scheduling Parallel Machines On-Line
full work available at URL: s0167-6377(99)00076-0
OpenAlex ID: W2117694648
description: scientific article; zbMATH DE number 1448751