Approximation results for the two-machine job shop under limited machine availability (Q1788868)
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 6949065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation results for the two-machine job shop under limited machine availability |
scientific article; zbMATH DE number 6949065 |
Statements
Approximation results for the two-machine job shop under limited machine availability (English)
0 references
9 October 2018
0 references
job shop
0 references
flow shop
0 references
scheduling
0 references
availability constraint
0 references
approximation schemes
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8854854106903076
0 references
0.8695871829986572
0 references
0.8519635796546936
0 references
0.8457450270652771
0 references
0.8421297669410706
0 references
