Approximation algorithms for time constrained scheduling
type: Item
instance of: scholarly article
title: Approximation algorithms for time constrained scheduling
zbMATH Open document ID: 0866.68012
author: Klaus Jansen
author: Sabine R. Öhring
published in: Information and Computation
publication date: 1997-07-06T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 993552
zbMATH Keywords: time constrained scheduling problem
MaRDI profile type: Publication
OpenAlex ID: W2088776663
cites work: Mutual exclusion scheduling
cites work: Precoloring extension. I: Interval graphs
cites work: Q4281629
cites work: Q4260373
cites work: Q3347319
cites work: Resource constrained scheduling as generalized bin packing
cites work: Q4198056
cites work: Q3328583
cites work: Q4838466
cites work: Precoloring Extension III: Classes of Perfect Graphs
cites work: Q4875172
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: Q4838453
cites work: On the hardness of approximating minimization problems
cites work: A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
cites work: Q4290987
DOI: 10.1006/INCO.1996.2616
description: scientific article; zbMATH DE number 993552