On Graham's bound for cyclic scheduling
type: Item
instance of: scholarly article
title: On Graham's bound for cyclic scheduling
zbMATH Open document ID: 0945.68012
DOI: 10.1016/S0167-8191(00)00033-8
published in: Parallel Computing
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1493387
zbMATH Keywords: cyclic scheduling
zbMATH Keywords: performance ratio
zbMATH Keywords: approximation algorithm
author: Philippe Chrétienne
MaRDI profile type: Publication
full work available at URL: s0167-8191(00)00033-8
OpenAlex ID: W1965934994
Recommended article: Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
Recommended article: Q3478256
Recommended article: Q5263822
Recommended article: Extending Graham's result on scheduling to other heuristics
Recommended article: A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule
Recommended article: Towards Tight Lower Bounds for Scheduling Problems
Recommended article: Q4866348
Recommended article: Bounds and tabu search for a cyclic max-min scheduling problem
Recommended article: A study of the cyclic scheduling problem on parallel processors
description: scientific article; zbMATH DE number 1493387