Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329)
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 2191871
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation schemes for job shop scheduling problems with controllable processing times |
scientific article; zbMATH DE number 2191871 |
Statements
Approximation schemes for job shop scheduling problems with controllable processing times (English)
0 references
4 August 2005
0 references
controllable processing times
0 references
approximation schemes
0 references
job shop scheduling
0 references
0 references
0 references
0.8998531699180603
0 references
0.8777009844779968
0 references
0.8535535931587219
0 references
