Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints (Q367232)
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 tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints |
scientific article; zbMATH DE number 6211883
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints |
scientific article; zbMATH DE number 6211883 |
Statements
Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints (English)
0 references
26 September 2013
0 references
permutation flowshop
0 references
setup times
0 references
time lags
0 references
mathematical programming
0 references
simulated annealing
0 references
0 references
0 references
0 references
0 references
0 references
