|
Volumn 57, Issue 4, 2009, Pages 1155-1160
|
A new bidirectional heuristic for the assembly line balancing problem
|
Author keywords
Assembly line balancing problem; Bidirectional; Critical path method; Heuristic
|
Indexed keywords
0-1-INTEGER PROGRAMMING;
ASSEMBLY LINE BALANCING PROBLEMS;
BRANCH-AND-BOUND ALGORITHMS;
CRITICAL PATH METHOD;
DYNAMIC PROGRAMMING MODEL;
EXACT SOLUTION;
HEURISTIC APPROACH;
LARGE-SCALE PROBLEM;
LAYOUT PLANNING;
MASS PRODUCTION;
NP-HARD;
NUMERICAL RESULTS;
TASK ASSIGNMENT;
ALGORITHMS;
ASSEMBLY;
ASSEMBLY MACHINES;
COMPUTATIONAL COMPLEXITY;
DYNAMIC PROGRAMMING;
HEURISTIC ALGORITHMS;
INTEGER PROGRAMMING;
LINEAR PROGRAMMING;
MANAGEMENT SCIENCE;
PRODUCTION ENGINEERING;
PROJECT MANAGEMENT;
SYSTEMS ENGINEERING;
TURNAROUND TIME;
HEURISTIC METHODS;
|
EID: 71849104220
PISSN: 03608352
EISSN: None
Source Type: Journal
DOI: 10.1016/j.cie.2009.05.004 Document Type: Article |
Times cited : (33)
|
References (14)
|