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 this page instead for the normal view: A new three-machine shop scheduling: complexity and approximation algorithm |
scientific article; zbMATH DE number 6236740
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
