SOME BOUNDS ON APPROXIMATION ALGORITHMS FOR n/m/I/L_<MAX> AND n/2/F/L_<MAX> SCHEDULING PROBLEMS (Q3673461)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: SOME BOUNDS ON APPROXIMATION ALGORITHMS FOR n/m/I/L_<MAX> AND n/2/F/L_<MAX> SCHEDULING PROBLEMS |
scientific article; zbMATH DE number 3827566
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SOME BOUNDS ON APPROXIMATION ALGORITHMS FOR n/m/I/L_<MAX> AND n/2/F/L_<MAX> SCHEDULING PROBLEMS |
scientific article; zbMATH DE number 3827566 |
Statements
SOME BOUNDS ON APPROXIMATION ALGORITHMS FOR n/m/I/L_<MAX> AND n/2/F/L_<MAX> SCHEDULING PROBLEMS (English)
0 references
1983
0 references
approximation algorithms
0 references
worst case bounds
0 references
2xn flow shop scheduling
0 references
minimization of maximum lateness
0 references
parallel machine scheduling
0 references
