New results on two-machine flow-shop scheduling with rejection (Q281786)
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: New results on two-machine flow-shop scheduling with rejection |
scientific article; zbMATH DE number 6579240
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New results on two-machine flow-shop scheduling with rejection |
scientific article; zbMATH DE number 6579240 |
Statements
New results on two-machine flow-shop scheduling with rejection (English)
0 references
11 May 2016
0 references
scheduling
0 references
flow shop
0 references
rejection penalty
0 references
NP-hard
0 references
on-line algorithm
0 references
0 references
0.9045056700706482
0 references
0.9015552997589112
0 references
0.8737759590148926
0 references
0.873253345489502
0 references
0.8707707524299622
0 references
