Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date (Q2384909)
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 5199607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date |
scientific article; zbMATH DE number 5199607 |
Statements
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date (English)
0 references
10 October 2007
0 references
Scheduling
0 references
flow-shop
0 references
late work criteria
0 references
metaheuristic
0 references
tabu search
0 references
simulated annealing
0 references
variable neighborhood search
0 references
0 references
0 references
0 references
0.9680052
0 references
0.9339596
0 references
0.8768322
0 references
0.86607987
0 references
0.8602732
0 references
0.8589421
0 references
0.8567003
0 references
