The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 18:31, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan |
scientific article |
Statements
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (English)
0 references
28 May 2008
0 references
scheduling
0 references
rejection penalty
0 references
fully polynomial-time approximation scheme
0 references