Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs (Q2331580)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs |
scientific article |
Statements
Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs (English)
0 references
29 October 2019
0 references
parallel-batch scheduling
0 references
release dates
0 references
drop-line jobs
0 references
polynomial-time approximation scheme
0 references
