Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times (Q3200873)
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: Publication:3200873 |
scientific article; zbMATH DE number 4176816
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times |
scientific article; zbMATH DE number 4176816 |
Statements
Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times (English)
0 references
1988
0 references
random processing times
0 references
stochastic scheduling
0 references
flow shop
0 references
two-machines
0 references
penalty cost function
0 references
exponential job processing times
0 references
0 references
0.9345802664756776
0 references
0.9325650334358216
0 references
0.8445131182670593
0 references
0.8316025733947754
0 references
