Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost (Q6542992)
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: Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost |
scientific article; zbMATH DE number 7852523
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost |
scientific article; zbMATH DE number 7852523 |
Statements
Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost (English)
0 references
23 May 2024
0 references
scheduling with rejection
0 references
machine non-availability
0 references
operator non-availability
0 references
dynamic programming
0 references
FPTAS
0 references
0 references
0 references