Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545)
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: Minimizing the number of late jobs for the permutation flowshop problem with secondary resources |
scientific article; zbMATH DE number 5318748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the number of late jobs for the permutation flowshop problem with secondary resources |
scientific article; zbMATH DE number 5318748 |
Statements
Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (English)
0 references
1 September 2008
0 references
flowshop
0 references
scheduling
0 references
number of tardy jobs
0 references
secondary resources
0 references
dual resource scheduling
0 references
simulated annealing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8236971497535706
0 references
0.7940806150436401
0 references
0.7827146649360657
0 references
0.7797435522079468
0 references
0.7649130821228027
0 references
