Minimizing total flow time and total completion time with immediate dispatching (Q878441)
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 5146579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total flow time and total completion time with immediate dispatching |
scientific article; zbMATH DE number 5146579 |
Statements
Minimizing total flow time and total completion time with immediate dispatching (English)
0 references
26 April 2007
0 references
scheduling jobs
0 references
0.8675588
0 references
0 references
0.8636472
0 references
0.8579419
0 references
0.85415477
0 references
0.84946084
0 references
0.84872925
0 references
0.84772265
0 references
0.8475028
0 references
0 references
