Three-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times (Q3011180)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times |
scientific article |
Statements
Three-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times (English)
0 references
28 June 2011
0 references
scheduling
0 references
flowshop
0 references
dominance relations
0 references
bounded processing and setup times
0 references
