A greedy heuristic for solving scheduling problems with bounded rejection cost (Q2147117)
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: A greedy heuristic for solving scheduling problems with bounded rejection cost |
scientific article; zbMATH DE number 7546560
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy heuristic for solving scheduling problems with bounded rejection cost |
scientific article; zbMATH DE number 7546560 |
Statements
A greedy heuristic for solving scheduling problems with bounded rejection cost (English)
0 references
22 June 2022
0 references
scheduling
0 references
single machine
0 references
job-rejection
0 references
heuristic
0 references
dynamic programming
0 references
0 references
0 references
0 references
0 references
0.8400669693946838
0 references
0.83975750207901
0 references
0.8370105028152466
0 references
0.8350164890289307
0 references
0.8310568332672119
0 references
