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 the normal view instead:
scientific article; zbMATH DE number 6566292
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.9304597973823548
0 references
0.919368863105774
0 references
0.9119192957878112
0 references
0.8992829918861389
0 references
0.8991297483444214
0 references
