Parallel scheduling problem with non-simultaneous machine available times (Q3014094)
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 5925944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel scheduling problem with non-simultaneous machine available times |
scientific article; zbMATH DE number 5925944 |
Statements
19 July 2011
0 references
scheduling
0 references
machine available times
0 references
polynomial-time approximation scheme
0 references
0.91920268535614
0 references
0.8926796913146973
0 references
0.8657032251358032
0 references
