An open shop scheduling problem with a non-bottleneck machine (Q1371949)
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 1083988
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An open shop scheduling problem with a non-bottleneck machine |
scientific article; zbMATH DE number 1083988 |
Statements
An open shop scheduling problem with a non-bottleneck machine (English)
0 references
6 November 1997
0 references
fully polynomial approximation scheme
0 references
worst-case analysis
0 references
approximation
0 references
two-machine non-preemptive open shop
0 references
makespan
0 references
maximum completion time
0 references
0.8750629425048828
0 references
0.8658753633499146
0 references
0.8617174029350281
0 references
0.8518232703208923
0 references
