A greedy heuristic for solving scheduling problems with bounded rejection cost (Q2147117): Difference between revisions
From MaRDI portal
Latest revision as of 09:54, 29 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A greedy heuristic for solving scheduling problems with bounded rejection cost |
scientific article |
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