Minimizing makespan in three-machine flow shops with deteriorating jobs (Q340257)
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 6652533
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing makespan in three-machine flow shops with deteriorating jobs |
scientific article; zbMATH DE number 6652533 |
Statements
Minimizing makespan in three-machine flow shops with deteriorating jobs (English)
0 references
14 November 2016
0 references
scheduling
0 references
flow shop
0 references
deteriorating jobs
0 references
makespan
0 references
branch-and-bound algorithm
0 references
heuristic algorithm
0 references
0.9918505
0 references
0.9616138
0 references
0.90743685
0 references
0.90341365
0 references
0 references
0.8761901
0 references
0.8701221
0 references
0.8700198
0 references
0.86951756
0 references
