Fast approximation algorithm for job sequencing with deadlines (Q1154384): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:21, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast approximation algorithm for job sequencing with deadlines |
scientific article |
Statements
Fast approximation algorithm for job sequencing with deadlines (English)
0 references
1981
0 references
fast approximation algorithm
0 references
job sequencing
0 references
deadlines
0 references
range-and-bound method
0 references
minimization of delay penalties
0 references
polynomial epsilon-approximation algorithm
0 references
