On lower and upper bounds for single machine parallel batch scheduling (Q2091210)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On lower and upper bounds for single machine parallel batch scheduling |
scientific article; zbMATH DE number 7610281
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On lower and upper bounds for single machine parallel batch scheduling |
scientific article; zbMATH DE number 7610281 |
Statements
On lower and upper bounds for single machine parallel batch scheduling (English)
0 references
1 November 2022
0 references
batch scheduling
0 references
precedence relations
0 references
optimization
0 references
dynamic programming
0 references
0 references
0 references
0.824687123298645
0 references
0.8055948615074158
0 references
0.8000353574752808
0 references
0.7879492044448853
0 references
