A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time (Q2384652)
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: A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time |
scientific article; zbMATH DE number 5199383
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time |
scientific article; zbMATH DE number 5199383 |
Statements
A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time (English)
0 references
10 October 2007
0 references
Scheduling
0 references
flowshop
0 references
makespan
0 references
heuristics
0 references
0.8299617767333984
0 references
0.8299617767333984
0 references
0.8250283002853394
0 references
0.8218862414360046
0 references
0.8154916763305664
0 references
