The open shop scheduling problem with a given sequence of jobs on one machine (Q4248937)
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: The open shop scheduling problem with a given sequence of jobs on one machine |
scientific article; zbMATH DE number 1300398
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The open shop scheduling problem with a given sequence of jobs on one machine |
scientific article; zbMATH DE number 1300398 |
Statements
10 June 1999
0 references
open shop
0 references
complexity
0 references
approximation
0 references
The open shop scheduling problem with a given sequence of jobs on one machine (English)
0 references
0.8870190382003784
0 references
0.8750629425048828
0 references
0.8595709800720215
0 references
0.8584921360015869
0 references
