A heuristic for preemptive scheduling with set-up times (Q1202243)
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: A heuristic for preemptive scheduling with set-up times |
scientific article; zbMATH DE number 108722
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic for preemptive scheduling with set-up times |
scientific article; zbMATH DE number 108722 |
Statements
A heuristic for preemptive scheduling with set-up times (English)
0 references
25 February 1993
0 references
preemptive scheduling
0 references
identical parallel machines
0 references
heuristics
0 references
worst- case analysis
0 references
\(m\) parallel machines
0 references
NP-complete
0 references
constant (job- and machine-independent) set-up times
0 references
polynomial time approximation algorithm
0 references
0.902958869934082
0 references
0.8989384770393372
0 references
0.8805148005485535
0 references
0.8772811889648438
0 references
0.8713597059249878
0 references
