Non-preemptive scheduling with setup times: a PTAS (Q1693204)
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: Non-preemptive scheduling with setup times: a PTAS |
scientific article; zbMATH DE number 6824360
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-preemptive scheduling with setup times: a PTAS |
scientific article; zbMATH DE number 6824360 |
Statements
Non-preemptive scheduling with setup times: a PTAS (English)
0 references
11 January 2018
0 references
scheduling
0 references
setup times
0 references
makespan minimization
0 references
approximation algorithms
0 references
polynomial time approximation schemes
0 references
0 references
0.8893915
0 references
0.88445395
0 references
0 references
0.88304883
0 references
0.8806152
0 references
0.87568855
0 references
