Approximation algorithms for time constrained scheduling (Q676776): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Sabine R. Öhring / rank | |||
Property / author | |||
Property / author: Sabine R. Öhring / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2088776663 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mutual exclusion scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Precoloring extension. I: Interval graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4281629 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4260373 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3347319 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Resource constrained scheduling as generalized bin packing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4838466 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Precoloring Extension III: Classes of Perfect Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4875172 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4838453 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the hardness of approximating minimization problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / 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 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4290987 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:55, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation algorithms for time constrained scheduling |
scientific article |
Statements
Approximation algorithms for time constrained scheduling (English)
0 references
6 July 1997
0 references
time constrained scheduling problem
0 references