Scheduling two agents with controllable processing times (Q976351)
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 5720343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling two agents with controllable processing times |
scientific article; zbMATH DE number 5720343 |
Statements
Scheduling two agents with controllable processing times (English)
0 references
11 June 2010
0 references
agent scheduling
0 references
controllable processing times
0 references
availability constraints
0 references
imprecise computation
0 references
total completion time
0 references
maximum tardiness
0 references
maximum lateness
0 references
0 references
0 references
0 references
0 references
0.8537575006484985
0 references
0.8510879874229431
0 references
0.8500304818153381
0 references
0.8448340892791748
0 references
