Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems (Q5470732): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539799358094 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2046471719 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:49, 30 July 2024
scientific article; zbMATH DE number 5029569
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems |
scientific article; zbMATH DE number 5029569 |
Statements
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems (English)
0 references
1 June 2006
0 references
approximation algorithm
0 references
linear programming relaxation
0 references
performance guarantee
0 references
precedence constraints
0 references
scheduling
0 references
