Flowshop scheduling problem to minimize total completion time with random and bounded processing times (Q4661102)
From MaRDI portal
scientific article; zbMATH DE number 2151588
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Flowshop scheduling problem to minimize total completion time with random and bounded processing times |
scientific article; zbMATH DE number 2151588 |
Statements
Flowshop scheduling problem to minimize total completion time with random and bounded processing times (English)
0 references
4 April 2005
0 references
scheduling
0 references
flowshop
0 references
uncertainty
0 references
geometrical approach
0 references
total completion time
0 references
