![]() |
Volumn 43, Issue 2, 1996, Pages 233-238
|
Optimal makespan schedule for three jobs on two machines
a
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
JOB ANALYSIS;
OPTIMIZATION;
PROBLEM SOLVING;
SCHEDULING;
JOB SHOP PROBLEM;
MAKESPAN CRITERION;
OPTIMAL SCHEDULE;
OPERATIONS RESEARCH;
|
EID: 0029709725
PISSN: 03409422
EISSN: None
Source Type: Journal
DOI: 10.1007/bf01680374 Document Type: Article |
Times cited : (13)
|
References (8)
|