An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (Q6094378): Difference between revisions
From MaRDI portal
Latest revision as of 03:52, 3 August 2024
scientific article; zbMATH DE number 7747734
Language | Label | Description | Also known as |
---|---|---|---|
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