Improving the solution complexity of the scheduling problem with deadlines: a general technique (Q2954334)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6674235
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving the solution complexity of the scheduling problem with deadlines: a general technique |
scientific article; zbMATH DE number 6674235 |
Statements
Improving the solution complexity of the scheduling problem with deadlines: A general technique (English)
0 references
12 January 2017
0 references
job-sequencing-with-deadlines scheduling problem
0 references
approximation algorithm
0 references
FPTAS
0 references
0 references
0 references
0 references
0.7659823298454285
0 references
0.7658984065055847
0 references
0.7642947435379028
0 references
0.760000467300415
0 references
