Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:46, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling a single machine with parallel batching to minimize makespan and total rejection cost |
scientific article |
Statements
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (English)
0 references
7 April 2016
0 references
batching machine scheduling
0 references
rejection
0 references
makespan
0 references
dynamic programming
0 references
FPTAS
0 references
approximation algorithms
0 references
