共 50 条
A BRANCH-AND-BOUND ALGORITHM FOR SCHEDULING JUST-IN-TIME MIXED-MODEL ASSEMBLY LINES
被引:10
|作者:
NG, WC
MAK, KL
机构:
[1] Department of Applied Statistics and Operational Research, City Polytechnic of Hong Kong
[2] Department of Industrial, Manufacturing Systems Engineering. University of Hong Kong., Hong Kong
关键词:
D O I:
10.1016/0925-5273(94)90130-9
中图分类号:
T [工业技术];
学科分类号:
08 ;
摘要:
In this paper, an efficient branch and bound algorithm is developed for determining effective assembly sequences for mixed-model assembly lines that produce products with similar part requirements in a just-in-time production environment.The objective is to maintain a constant usage rate for every part used by the lines. A numerical example is used to illustrate the procedure of the algorithm. The performance of the algorithm is then evaluated by using randomly generated test problems.
引用
收藏
页码:169 / 183
页数:15
相关论文