Approximations for the time spent in a dynamic job shop with applications to due-date assignment (Q3792467)
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: Approximations for the time spent in a dynamic job shop with applications to due-date assignment |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximations for the time spent in a dynamic job shop with applications to due-date assignment |
scientific article |
Statements
Approximations for the time spent in a dynamic job shop with applications to due-date assignment (English)
0 references
1988
0 references
queueing network
0 references
exponential approximation
0 references
Markov approximations
0 references
total time spent in a dynamic job shop
0 references
numerical simulations
0 references
0.832281231880188
0 references
0.765388548374176
0 references
0.7505275011062622
0 references
0.7500253319740295
0 references
0.7494334578514099
0 references
