Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times (Q3200873): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58249513, #quickstatements; #temporary_batch_1706518640034 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:59, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times |
scientific article |
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
