|
Volumn 5, Issue 6, 2002, Pages 487-499
|
A heuristic approach to allocating the continuous resource in discrete-continuous scheduling problems to minimize the makespan
|
Author keywords
Discrete continuous scheduling; Heuristic; Makespan; Mathematical programming problem; Tabu search
|
Indexed keywords
COMPUTATION THEORY;
PROBLEM SOLVING;
SCHEDULING;
MAKESPAN;
MATHEMATICAL PROGRAMMING PROBLEM;
TABU SEARCH;
HEURISTIC METHODS;
|
EID: 19044362523
PISSN: 10946136
EISSN: None
Source Type: Journal
DOI: 10.1002/jos.119 Document Type: Article |
Times cited : (30)
|
References (11)
|