Type-1 U-shaped Assembly Line Balancing under uncertain task time
被引:5
作者:
Li, Yuchen
论文数: 0引用数: 0
h-index: 0
机构:
Beijing Univ Technol, Sch Econ & Management, Beijing 100124, Peoples R ChinaBeijing Univ Technol, Sch Econ & Management, Beijing 100124, Peoples R China
Li, Yuchen
[1
]
Hu, Xiaofeng
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Jiao Tong Univ, Sch Mech Engn, Shanghai 200240, Peoples R ChinaBeijing Univ Technol, Sch Econ & Management, Beijing 100124, Peoples R China
Hu, Xiaofeng
[2
]
Tang, Xiaowen
论文数: 0引用数: 0
h-index: 0
机构:
Beijing Univ Technol, Sch Econ & Management, Beijing 100124, Peoples R ChinaBeijing Univ Technol, Sch Econ & Management, Beijing 100124, Peoples R China
Tang, Xiaowen
[1
]
Kucukkoc, Ibrahim
论文数: 0引用数: 0
h-index: 0
机构:
Balikesir Univ, Dept Ind Engn, TR-10145 Balikesir, TurkeyBeijing Univ Technol, Sch Econ & Management, Beijing 100124, Peoples R China
Kucukkoc, Ibrahim
[3
]
机构:
[1] Beijing Univ Technol, Sch Econ & Management, Beijing 100124, Peoples R China
[2] Shanghai Jiao Tong Univ, Sch Mech Engn, Shanghai 200240, Peoples R China
[3] Balikesir Univ, Dept Ind Engn, TR-10145 Balikesir, Turkey
来源:
IFAC PAPERSONLINE
|
2019年
/
52卷
/
13期
关键词:
Assembly line balancing;
Uncertainty theory;
Uncertain Programming;
Uncertain task time attribute;
Branch and bound remember;
PROGRAMMING-MODEL;
ALGORITHM;
D O I:
10.1016/j.ifacol.2019.11.324
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
Recently, assembly line balancing problem with uncertain task time gains more and more attention in the literature. Task time uncertainty may overload workstations. Uncertain task time attributes were studied in the frameworks of the probability theory. In this paper, we use a new method, which is the uncertainty theory, to model the uncertain task time as the historical task time information is unavailable. We incorporate the uncertainty into the constraints of the type-1 U-shaped assembly line balancing problem. We derive some useful theorems related to the optimal solutions. Further, we develop an algorithm based on the branch and bound remember algorithm to solve the proposed problem. Finally, numerical studies are conducted to illustrate our model. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
引用
收藏
页码:992 / 997
页数:6
相关论文
共 20 条
[1]
[Anonymous], 2010, FIXED POINT THEORY A, DOI DOI 10.1155/2010/283827
机构:
Ecole Natl Super Mines, EMSE FAYOL, CNRS, LIMOS,UMR6158, F-42023 St Etienne, FranceEcole Natl Super Mines, EMSE FAYOL, CNRS, LIMOS,UMR6158, F-42023 St Etienne, France
Battaia, Olga
Dolgui, Alexandre
论文数: 0引用数: 0
h-index: 0
机构:
Ecole Natl Super Mines, EMSE FAYOL, CNRS, LIMOS,UMR6158, F-42023 St Etienne, FranceEcole Natl Super Mines, EMSE FAYOL, CNRS, LIMOS,UMR6158, F-42023 St Etienne, France
机构:
Beijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing 100044, Peoples R ChinaBeijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing 100044, Peoples R China
Gao, Yuan
Qin, Zhongfeng
论文数: 0引用数: 0
h-index: 0
机构:
Beihang Univ, Sch Econ & Management, Beijing 100191, Peoples R ChinaBeijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing 100044, Peoples R China
机构:
Ecole Natl Super Mines, EMSE FAYOL, CNRS, LIMOS,UMR6158, F-42023 St Etienne, FranceEcole Natl Super Mines, EMSE FAYOL, CNRS, LIMOS,UMR6158, F-42023 St Etienne, France
Battaia, Olga
Dolgui, Alexandre
论文数: 0引用数: 0
h-index: 0
机构:
Ecole Natl Super Mines, EMSE FAYOL, CNRS, LIMOS,UMR6158, F-42023 St Etienne, FranceEcole Natl Super Mines, EMSE FAYOL, CNRS, LIMOS,UMR6158, F-42023 St Etienne, France
机构:
Beijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing 100044, Peoples R ChinaBeijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing 100044, Peoples R China
Gao, Yuan
Qin, Zhongfeng
论文数: 0引用数: 0
h-index: 0
机构:
Beihang Univ, Sch Econ & Management, Beijing 100191, Peoples R ChinaBeijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing 100044, Peoples R China