The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182)
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: The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost |
scientific article; zbMATH DE number 6598033
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost |
scientific article; zbMATH DE number 6598033 |
Statements
The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (English)
0 references
24 June 2016
0 references
batch scheduling
0 references
bicriteria scheduling
0 references
rejection
0 references
total completion time
0 references
0 references
0 references
0 references
0 references
0.92410237
0 references
0.9116233
0 references
0.89786965
0 references
0.89500654
0 references
0.8924848
0 references
0.8905527
0 references
0.8880896
0 references
