Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs (Q2331580)
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 7124098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs |
scientific article; zbMATH DE number 7124098 |
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
0 references
0 references
0.8633506298065186
0 references
0.860822856426239
0 references
0.8577450513839722
0 references
0.8438668847084045
0 references
0.8399389386177063
0 references
