Fast approximation algorithm for job sequencing with deadlines (Q1154384): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(81)90008-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065104488 / rank | |||
Normal rank | |||
Latest revision as of 10:32, 30 July 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
0 references
