Approximation Algorithms for Three-Machine Open Shop Scheduling (Q4282281): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/ijoc.5.3.321 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057396166 / rank | |||
Normal rank | |||
Latest revision as of 23:55, 19 March 2024
scientific article; zbMATH DE number 516691
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithms for Three-Machine Open Shop Scheduling |
scientific article; zbMATH DE number 516691 |
Statements
Approximation Algorithms for Three-Machine Open Shop Scheduling (English)
0 references
24 March 1994
0 references
greedy algorithm
0 references
three machine open shop scheduling
0 references
makespan
0 references
worst- case performance ratio
0 references
linear time heuristic
0 references
