On the complexity of bi-criteria scheduling on a single batch processing machine (Q633556): Difference between revisions
From MaRDI portal
Latest revision as of 23:05, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of bi-criteria scheduling on a single batch processing machine |
scientific article |
Statements
On the complexity of bi-criteria scheduling on a single batch processing machine (English)
0 references
1 April 2011
0 references
scheduling
0 references
batch processing
0 references
bi-criteria
0 references
complexity
0 references
0 references
0 references
0 references