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
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/0305215x.2020.1797000 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3082661417 / rank | |||
Normal rank | |||
Revision as of 10:43, 30 July 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
