共 42 条
Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment
被引:23
作者:
Yang, Caijun
[1
,3
]
Gao, Jie
[2
]
机构:
[1] Xi An Jiao Tong Univ, Sch Pharm, Dept Pharm Adm & Clin Pharm, Xian 710061, Shannxi, Peoples R China
[2] Xi An Jiao Tong Univ, Sch Management, Xian 710049, Shannxi, Peoples R China
[3] Xi An Jiao Tong Univ, Ctr Drug Safety & Policy Res, Xian 710061, Shannxi, Peoples R China
基金:
中国博士后科学基金;
关键词:
Mixed-model assembly line;
Demand variation;
Cross-training;
Branch;
bound and remember;
GENETIC ALGORITHM;
DESIGN;
WORKSTATIONS;
FORMULATION;
SYSTEMS;
WORKERS;
D O I:
10.1016/j.cor.2015.07.007
中图分类号:
TP39 [计算机的应用];
学科分类号:
081203 ;
0835 ;
摘要:
The internationalization of markets and increased sophistication of consumers have led to an increase in the variety and uncertainty of products demand. It spurs the wide use of flexible production systems in producers. In this study, we aim to present a flexible mixed-model assembly line with adjacent workforce cross-training policy to account for this issue. With the adjacent cross-training, the skill of each task can be learned by two workers in adjacent stations and then task reallocation is possible when demand varies. Whenever the production volume or product mix changes, the only modification of the line is shifting some tasks to the adjacent stations where the workers can deal with. In this way, the line can achieve quick response to demand variation with high efficiency without additional trainings or great changes (such as: employment or layoff). The problem is formulated and some important properties are characterized. Then, a branch, bound and remember (BB&R) algorithm is developed to solve the problem. The efficiency and effectiveness of the proposed algorithm and this policy are tested on 450 representative instances, which are randomly generated on the basis of 25 well-known benchmark problems. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:139 / 148
页数:10
相关论文