Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (Q2215189): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:10, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection |
scientific article |
Statements
Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (English)
0 references
11 December 2020
0 references
scheduling
0 references
batch processing
0 references
job rejection
0 references
approximation algorithm
0 references
performance analysis
0 references
