Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines (Q3703565)
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: Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines |
scientific article; zbMATH DE number 3930699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines |
scientific article; zbMATH DE number 3930699 |
Statements
Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines (English)
0 references
1985
0 references
highest level first policy
0 references
stochastic scheduling
0 references
independent exponentially distributed processing times
0 references
two identical parallel machines
0 references
intree precedence constraints
0 references
expected makespan
0 references
0.8755382299423218
0 references
0.8662683367729187
0 references
0.8632615804672241
0 references
0.8446243405342102
0 references
0.8402726650238037
0 references
