A note on \(n\)-jobs and 3-machines flow shop scheduling problem (Q2871517)
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: A note on \(n\)-jobs and 3-machines flow shop scheduling problem |
scientific article; zbMATH DE number 6243447
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on \(n\)-jobs and 3-machines flow shop scheduling problem |
scientific article; zbMATH DE number 6243447 |
Statements
8 January 2014
0 references
flow shop
0 references
sequencing
0 references
dominance
0 references
A note on \(n\)-jobs and 3-machines flow shop scheduling problem (English)
0 references
