Permutation flow shop problem with shortening job processing times (Q2821099)
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: Permutation flow shop problem with shortening job processing times |
scientific article; zbMATH DE number 6628045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Permutation flow shop problem with shortening job processing times |
scientific article; zbMATH DE number 6628045 |
Statements
16 September 2016
0 references
scheduling
0 references
permutation flow shop
0 references
shortening job processing times
0 references
makespan
0 references
branch-and-bound algorithm
0 references
heuristic algorithm
0 references
0 references
0 references
0 references
0 references
0 references
Permutation flow shop problem with shortening job processing times (English)
0 references
0.8553602695465088
0 references
0.8364104628562927
0 references
0.8364101052284241
0 references
0.8357359766960144
0 references
0.8341129422187805
0 references
