Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan (Q3902467)
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: Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan |
scientific article; zbMATH DE number 3711353
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan |
scientific article; zbMATH DE number 3711353 |
Statements
Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan (English)
0 references
1981
0 references
stochastic scheduling
0 references
identical parallel processors
0 references
mean completion time
0 references
maximum completion time
0 references
