A BRANCH-AND-BOUND ALGORITHM FOR SCHEDULING JUST-IN-TIME MIXED-MODEL ASSEMBLY LINES

Authors
NG WC MAK KL
Citation
Wc. Ng et Kl. Mak, A BRANCH-AND-BOUND ALGORITHM FOR SCHEDULING JUST-IN-TIME MIXED-MODEL ASSEMBLY LINES, International journal of production economics, 33(1-3), 1994, pp. 169-183
Citations number
NO
Categorie Soggetti
Engineering
Journal title
International journal of production economics → ACNP
ISSN journal
09255273
Volume
33
Issue
1-3
Year of publication
1994
Pages
169 - 183
Database
ISI
SICI code
0925-5273(1994)33:1-3<169:ABAFSJ>2.0.ZU;2-3
Abstract
In this paper, an efficient branch and bound algorithm is developed fo r determining effective assembly sequences for mixed-model assembly li nes that produce products with similar part requirements in a just-in- time production environment.The objective is to maintain a constant us age 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.