Batch scheduling with deadlines on parallel machines (Q1273116)
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 1229554
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Batch scheduling with deadlines on parallel machines |
scientific article; zbMATH DE number 1229554 |
Statements
Batch scheduling with deadlines on parallel machines (English)
0 references
7 March 1999
0 references
fully polynomial approximation scheme
0 references
computational complexity
0 references
parallel machines
0 references
batches
0 references
sequence-independent machine set-up time
0 references
NP-hard
0 references
0 references
0.9372240900993348
0 references
0.9205015301704408
0 references
0.846384584903717
0 references
0.8324382901191711
0 references
