Pre-emptive scheduling problems with controllable processing times (Q880501)
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 5153334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pre-emptive scheduling problems with controllable processing times |
scientific article; zbMATH DE number 5153334 |
Statements
Pre-emptive scheduling problems with controllable processing times (English)
0 references
15 May 2007
0 references
single machine scheduling
0 references
parallel machine scheduling
0 references
controllable processing times
0 references
bicriteria problems
0 references
polymatroids
0 references
greedy algorithms
0 references
0 references
0 references
0.9466172456741332
0 references
0.8859014511108398
0 references
0.8806300759315491
0 references
0.878515899181366
0 references
0.869548499584198
0 references
