An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (Q6094378)
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 7747734
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time |
scientific article; zbMATH DE number 7747734 |
Statements
An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (English)
0 references
10 October 2023
0 references
flowshop
0 references
no-wait
0 references
makespan
0 references
total completion time
0 references
0 references
0 references
0 references
0 references
0 references
0.837604284286499
0 references
0.8282399773597717
0 references
0.8218383193016052
0 references
0.8153542280197144
0 references
0.8087632060050964
0 references
