Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641): Difference between revisions
From MaRDI portal
Import recommendations run Q6767936 |
Changed label, description and/or aliases in en, and other parts |
||
| description / en | description / en | ||
scientific article | scientific article; zbMATH DE number 1294690 | ||
Latest revision as of 21:22, 16 July 2025
scientific article; zbMATH DE number 1294690
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Makespan minimization in open shops: A polynomial time approximation scheme |
scientific article; zbMATH DE number 1294690 |
Statements
Makespan minimization in open shops: A polynomial time approximation scheme (English)
0 references
3 June 1999
0 references
worst-case analysis
0 references
polynomial time approximation scheme
0 references
makespan minimization
0 references
open shop scheduling
0 references
0.93882847
0 references
0.9200907
0 references
0.91364694
0 references
0.9089877
0 references
0.9073361
0 references
0.90662813
0 references
0.90303874
0 references
0.8898996
0 references
