Two-machine flow-shop scheduling with rejection (Q1762086)
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: Two-machine flow-shop scheduling with rejection |
scientific article; zbMATH DE number 6107539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-machine flow-shop scheduling with rejection |
scientific article; zbMATH DE number 6107539 |
Statements
Two-machine flow-shop scheduling with rejection (English)
0 references
15 November 2012
0 references
flow-shop scheduling
0 references
scheduling with rejection
0 references
bicriteria optimization
0 references
NP-hard
0 references
approximation algorithm
0 references
pseudo-polynomial time algorithm
0 references
FPTAS
0 references
0 references
0 references
0.919987142086029
0 references
0.9015552997589112
0 references
0.8914825916290283
0 references
0.8698049187660217
0 references
0.8677863478660583
0 references
