Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints |
scientific article; zbMATH DE number 6958250
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints |
scientific article; zbMATH DE number 6958250 |
Statements
Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (English)
0 references
18 October 2018
0 references
single machine scheduling
0 references
release times
0 references
lateness
0 references
deadlines
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8930208086967468
0 references
0.8851565718650818
0 references
0.8387133479118347
0 references
0.8151842951774597
0 references
