Parallel machine problems with equal processing times: a survey (Q2434248)
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 6255094
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel machine problems with equal processing times: a survey |
scientific article; zbMATH DE number 6255094 |
Statements
Parallel machine problems with equal processing times: a survey (English)
0 references
5 February 2014
0 references
parallel machine problem
0 references
equal processing times
0 references
non-preemptive problems
0 references
preemptive problems
0 references
polynomial algorithms
0 references
NP-hard problems
0 references
0 references
0 references
0 references
0 references
0 references
0.8274144530296326
0 references
0.8269790410995483
0 references
0.8200410008430481
0 references
