|
Volumn 23, Issue 3, 1994, Pages 617-632
|
Improved approximation algorithms for shop scheduling problems
|
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
JOB ANALYSIS;
OPERATIONS RESEARCH;
OPTIMIZATION;
POLYNOMIALS;
SCHEDULING;
APPROXIMATION ALGORITHMS;
JOB SHOP SCHEDULING;
OPTIMAL LENGTH SCHEDULE;
POLYLOGARITHMIC APPROXIMATION;
POLYNOMIAL TIME ALGORITHM;
ALGORITHMS;
|
EID: 0028452796
PISSN: 00975397
EISSN: None
Source Type: Journal
DOI: 10.1137/S009753979222676X Document Type: Article |
Times cited : (134)
|
References (20)
|