A New Heuristic for Three-Machine Flow Shop Scheduling (Q4346341)
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 1042706
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A New Heuristic for Three-Machine Flow Shop Scheduling |
scientific article; zbMATH DE number 1042706 |
Statements
A New Heuristic for Three-Machine Flow Shop Scheduling (English)
0 references
3 August 1997
0 references
sequencing
0 references
three-machine flow shop
0 references
makespan
0 references
Johnson's algorithm
0 references
worst-case performance
0 references
0.86630779504776
0 references
0.8554440140724182
0 references
0.853588342666626
0 references
0.8514959812164307
0 references
