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 the normal view instead:
scientific article; zbMATH DE number 1091247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9067895412445068
0 references
0.8913606405258179
0 references
0.8815262317657471
0 references
0.874677836894989
0 references
0.8719300627708435
0 references
