A new three-machine shop scheduling: complexity and approximation algorithm (Q386427)
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 6236740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new three-machine shop scheduling: complexity and approximation algorithm |
scientific article; zbMATH DE number 6236740 |
Statements
A new three-machine shop scheduling: complexity and approximation algorithm (English)
0 references
9 December 2013
0 references
open shop
0 references
flow shop
0 references
approximation algorithm
0 references
worst-case analysis
0 references
0 references
0.8552693724632263
0 references
0.8317200541496277
0 references
0.8249448537826538
0 references
0.8157524466514587
0 references
0.8132929801940918
0 references
