Batch scheduling with deadlines on parallel machines: an NP-hard case (Q287238)
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 6585488
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Batch scheduling with deadlines on parallel machines: an NP-hard case |
scientific article; zbMATH DE number 6585488 |
Statements
Batch scheduling with deadlines on parallel machines: an NP-hard case (English)
0 references
26 May 2016
0 references
parallel machine scheduling
0 references
batching
0 references
computational complexity
0 references
0 references
0.9205015301704408
0 references
0.888780415058136
0 references
0.8848009705543518
0 references
0.8535526394844055
0 references
0.8535526394844055
0 references
