Two-machine flowshop scheduling to minimize the number of tardy jobs (Q4367035)
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: Two-machine flowshop scheduling to minimize the number of tardy jobs |
scientific article; zbMATH DE number 1091247
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-machine flowshop scheduling to minimize the number of tardy jobs |
scientific article; zbMATH DE number 1091247 |
Statements
Two-machine flowshop scheduling to minimize the number of tardy jobs (English)
0 references
25 November 1997
0 references
two-machine flowshop
0 references
total number of tardy jobs
0 references
polynomially solvable special cases
0 references
heuristic
0 references
