Scheduling a two-stage flowshop under makespan constraint (Q2476691)
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 5248482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling a two-stage flowshop under makespan constraint |
scientific article; zbMATH DE number 5248482 |
Statements
Scheduling a two-stage flowshop under makespan constraint (English)
0 references
12 March 2008
0 references
scheduling
0 references
flowshop
0 references
heuristics
0 references
approximation algorithms
0 references
0 references
0.8430978059768677
0 references
0.8412501215934753
0 references
0.8353959918022156
0 references
0.8292192220687866
0 references
0.8248314261436462
0 references
