Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Scheduling a single machine with parallel batching to minimize makespan and total rejection cost |
scientific article; zbMATH DE number 6566292
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling a single machine with parallel batching to minimize makespan and total rejection cost |
scientific article; zbMATH DE number 6566292 |
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
0 references
