Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151)
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: Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches |
scientific article; zbMATH DE number 6876592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches |
scientific article; zbMATH DE number 6876592 |
Statements
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (English)
0 references
30 May 2018
0 references
scheduling with controllable processing times
0 references
scheduling with imprecise computation
0 references
flows in networks
0 references
optimization with submodular constraints
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9264748
0 references
0 references
0.8751576
0 references
0.8724296
0 references
0.8694165
0 references
0.8685903
0 references
0.86786056
0 references
0.8650863
0 references
