Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2015.10.021 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2015.10.021 / rank | |||
Normal rank | |||
Latest revision as of 12:55, 9 December 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
0 references
