Line-Balancing-in-the-Real-World生产线平衡在现实世界大学毕业论文英文文献翻译及原文
上传者:潘龙平|上传时间:2017-06-03|密次下载
Line-Balancing-in-the-Real-World生产线平衡在现实世界大学毕业论文英文文献翻译及原文
毕 业 设 计(论文)
外 文 文 献 翻 译
文献、资料中文题目:生产线平衡在现实世界
文献、资料英文题目:Line Balancing in the Real World 文献、资料来源:
文献、资料发表(出版)日期:
院 (部):
专 业:
班 级:
姓 名:
学 号:
指导教师:
翻译日期: 2017.02.14
Abstract: Line Balancing (LB) is a classic, well-researched Operations Research (OR) optimization problem of significant industrial importance. It is one of those problems where domain expertise does not help very much: whatever the number of years spent solving it, one is each time facing an intractable problem with an astronomic number of possible solutions and no real guidance on how to solve it in the best way, unless one postulates that the old way is the best way .Here we explain an apparent paradox: although many algorithms have been proposed in the past, and despite the problem‘s practical importance, just one commercially available LB software currently appears to be available for application in industries such as automotive. We speculate that this may be due to a misalignment between the academic LB problem addressed by OR, and the actual problem faced by the industry.
Keyword: Line Balancing, Assembly lines, Optimization
Line Balancing in the Real World
Emanuel Falkenauer
Optimal Design
Av. Jeanne 19A bote2, B-1050 Brussels, Belgium
+32 (0)2 646 10 74
E.Falkenauer@
1 Introduction
Assembly Line Balancing, or simply Line Balancing (LB), is the problem of assigning operations to workstations along an assembly line, in such a way that the assignment be optimal in some sense. Ever since Henry Ford‘s introduction of assembly lines, LB has been an optimization problem of significant industrial importance: the efficiency difference between an optimal and a sub-optimal assignment can yield economies (or waste) reaching millions of dollars per year. LB is a classic Operations Research (OR) optimization problem, having been tackled by OR over several decades. Many algorithms have been proposed for the problem. Yet despite the practical importance of the problem, and the OR efforts that have been made to tackle it, little commercially available software is available to help industry in optimizing their lines. In fact, according to a recent survey by Becker and Scholl (2004), there appear to be currently just two commercially available packages featuring both a state of the art optimization algorithm and a user-friendly interface for data management. Furthermore, one of those packages appears to handle only the ―clean‖ formulation of the problem (Simple Assembly Line Balancing Problem, or SALBP), which leaves only one package available for industries such as automotive. This situation appears to be paradoxical, or at least unexpected: given the huge economies LB can generate, one would expect several software packages vying to grab a part of those economies.
It appears that the gap between the available OR results and their dissemination in Today‘s industry, is probably due to a misalignment between the academic LB problem addressed by most of the OR approaches, and the actual problem being faced by the industry. LB is a difficult optimization problem even its simplest forms are NP-hard – see Garry and Johnson, 1979), so the approach taken by OR has typically been to simplify it, in order to bring it to a level of complexity amenable to OR tools. While this is a perfectly valid approach in general, in the particular case of LB it led some definitions of the problem hat ignore many aspects of the real-world problem.
Unfortunately, many of the aspects that have been left out in the OR approach are in fact crucial to industries such as automotive, in the sense that any solution ignoring (violating) those aspects becomes unusable in the industry.
In the sequel, we first briefly recall classic OR definitions of LB, and then review
how the actual line balancing problem faced by the industry differs from them, and why a solution to the classic OR problem maybe unusable in some industries. 2 OR Definitions of LB
The classic OR definition of the line balancing problem, dubbed SALBP (Simple Assembly Line Balancing Problem) by Becker and Scholl (2004), goes as follows. Given a set of tasks of various durations, a set of precedence constraints among the tasks, and a set of workstations, assign each task to exactly one workstation in such a way that no precedence constraint is violated and the assignment is optimal. The optimality criterion gives rise to two variants of the problem: either a cycle time is given that cannot be exceeded by the sum of durations of all tasks assigned to any workstation and the number of workstations is to be minimized, or the number of workstations is fixed and the line cycle time, equal to the largest sum of durations of task assigned to a workstation, is to be minimized.
Although the SALBP only takes into account two constraints (the precedence constraints plus the cycle time, or the precedence constraints plus the number of workstations), it is by far the variant of line balancing that has been the most researched. We have contributed to that effort in Falkenauer and Delchambre (1992), where we proposed a Grouping Genetic Algorithm approach that achieved some of the best performance in the field. The Grouping Genetic Algorithm technique itself was presented in detail in Falkenauer (1998).
However well researched, the SALBP is hardly applicable in industry, as we will see shortly. The fact has not escaped the attention of the OR researches, and Becker and Scholl (2004) define many extensions to SALBP, yielding a common denomination GALBP (Generalized Assembly Line Balancing Problem). Each of the extensions reported in their authoritative survey aims to handle an additional difficulty present in real-world line balancing. We have tackled one of those aspects in Falkenauer (1997), also by applying the Grouping Genetic Algorithm.
The major problem with most of the approaches reported by Becker and Scholl (2004) is that they generalize the simple SALBP in just one or two directions. The real world line balancing, as faced in particular by the automotive industry, requires tackling many of those generalizations simultaneously.
3 What Differs in the Real World?
Although even the simple SALBP is NP-hard, it is far from capturing the true complexity of the problem in its real-world incarnations. On the other hand, small instances of the problem, even though they are difficult to solve to optimality, are a tricky target for line balancing software, because small instances of the problem can be solved closet optimality by hand. That is however not the case in the automotive and related industries (Bus, truck, aircraft, heavy machinery, etc.), since those industries routinely feature Assembly lines with dozens or hundreds of workstations, and hundreds or thousands of Operations. Those industries are therefore the prime targets for line balancing software.
Unfortunately, those same industries also need to take into account many of the
GALBP extensions at the same time, which may explain why, despite the impressive OR Work done on line balancing; only one commercially available software seems tube currently available for those industries.
We identify below some of the additional difficulties (with respect to SALBP) that must be tackled in a line balancing tool, in order to be applicable in those industries.
3.1 Do Not Balance but Re-balance
Many of the OR approaches implicitly assume that the problem to be solved involves a new, yet-to-be-built assembly line, possibly housed in a new, yet-to-be-built factory. To our opinion, this is the gravest oversimplification of the classic OR approach, for in practice, this is hardly ever the case. The vast majority of real-world line balancing tasks involve existing lines, housed in existing factories – infect, the target line typically needs tube rebalanced rather than balanced, the need arising from changes in the product or the mix of models being assembled in the line, the assembly technology, the available workforce, or the production targets. This has some far-reaching implications, outlined below.
3.2 Workstations Have Identities
As pointed out above, the vast majority of real-world line balancing tasks involves existing lines housed in existing factories. In practice, this seemingly ―uninteresting‖ observation has one far-reaching consequence, namely that each workstation in the line does have its own identity. This identity is not due to any ―incapacity of abstraction‖ on part of the process engineers, but rather to the fact that the workstations are indeed not identical: each has its own space constraints (e.g. a workstation below a low ceiling cannot elevate the car above the operators‘ heads), its own heavy equipment that cannot be moved spare huge costs, its own capacity of certain supplies (e.g. compressed air), its own restrictions on the operations that can be carried out there (e.g. do not place welding operations just beside the painting shop), etc.
3.3 Cannot Eliminate Workstations
Since workstations do have their identity (as observed above), it becomes obvious that a real-world LB tool cannot aim at eliminating workstations. Indeed, unless the eliminated workstations were all in the front of the line or its tail, their elimination would create gaping holes in the line, by virtue of the other workstations‘ retaining of their identities, including their geographical positions in the workshop. Also, it softens the case that many workstations that could possibly be eliminated by the algorithm are in fact necessary because of zoning constraints.
4 Conclusions
The conclusions inspection 3 stems from our extensive contacts with automotive and related industries, and reflects their true needs. Other ―exotic‖ constraints may apply in any given real-world assembly line, but line balancing tool for those industries must be able to handle at least those aspects of the problem. This is very
far from the ―clean‖ academic SALBP, as well as most GALBP extensions reported by Becker and Scholl (2004). In fact, such a tool must simultaneously solve several-hard problems:
? Find a feasible defined replacement for all undefined (?ANY‘) ergonomic constraints on workstations, i.e. One compatible with the ergonomic constraints and precedence constraints defined on operations, as well as zoning constraints and possible drifting operations
? Solve the within-workstation scheduling problem on all workstations, for all products being assembled on the line
? Assign the operations to workstations to achieve the best average balance, while keeping the peak times at a manageable level. Clearly, the real-world line balancing problem described above is extremely difficult to solve. This is compounded byte size of the problem encountered in the target industries, which routinely feature assembly lines with dozens or hundreds of workstations with multiple operators, and hundreds or thousands of operations.
We‘ve identified a number of aspects of the line balancing problem that are vital in industries such as automotive, yet that have been either neglected in the OR work on the problem, or handled separately from each other. According to our experience, a line balancing to applicable in those industries must be able to handle all of them simultaneously. That gives rise to an extremely complex optimization problem. The complexity of the problem, and the need to solve it quickly, may explain why there appears to be just one commercially available software for solving it, namely outline by Optimal Design. More information on Outline, including its rich graphic user interface, is available at http://www.wendangwang.com/OptiLine/OptiLine.htm. References
1 Becker C. and Scholl, A. (2004) `A survey on problems and methods in generalized assemblyline balancing', European Journal of Operations Research, in press. Available online at http://www.wendangwang.com/doi:10.1016/j.ejor.2004.07.023. Journal article.
2 Falkenauer, E. and Delchambre, A. (1992) `Genetic Algorithm for Bin Packing and Line Balancing', Proceedings of the 1992 IEEE International Conference on Robotics and Automation, May10-15, 1992, Nice, France. IEEE Computer Society Press, Los Alamitos, CA. Pp. 1186-1192. Conference proceedings.
3 Falkenauer, E. (1997) `A Grouping Genetic Algorithm for Line Balancing with Resource Dependent Task Times', Proceedings of the Fourth International Conference on Neural Information Processing (ICONIP‘97), University of Otego, Dunedin, New Zealand, November 24-28, 1997. Pp. 464-468. Conference proceedings.
4 Falkenauer, E. (1998) Genetic Algorithms and Grouping Problems, John Wiley Sons, Chi Chester, UK. Book.
5 Gary. R. and Johnson D. S. (1979) Computers and Intractability - A Guide to the Theory of NP-completeness, W.H.Freeman Co., San Francisco, USA. Book.
下载文档
热门试卷
- 2016年四川省内江市中考化学试卷
- 广西钦州市高新区2017届高三11月月考政治试卷
- 浙江省湖州市2016-2017学年高一上学期期中考试政治试卷
- 浙江省湖州市2016-2017学年高二上学期期中考试政治试卷
- 辽宁省铁岭市协作体2017届高三上学期第三次联考政治试卷
- 广西钦州市钦州港区2016-2017学年高二11月月考政治试卷
- 广西钦州市钦州港区2017届高三11月月考政治试卷
- 广西钦州市钦州港区2016-2017学年高一11月月考政治试卷
- 广西钦州市高新区2016-2017学年高二11月月考政治试卷
- 广西钦州市高新区2016-2017学年高一11月月考政治试卷
- 山东省滨州市三校2017届第一学期阶段测试初三英语试题
- 四川省成都七中2017届高三一诊模拟考试文科综合试卷
- 2017届普通高等学校招生全国统一考试模拟试题(附答案)
- 重庆市永川中学高2017级上期12月月考语文试题
- 江西宜春三中2017届高三第一学期第二次月考文科综合试题
- 内蒙古赤峰二中2017届高三上学期第三次月考英语试题
- 2017年六年级(上)数学期末考试卷
- 2017人教版小学英语三年级上期末笔试题
- 江苏省常州西藏民族中学2016-2017学年九年级思想品德第一学期第二次阶段测试试卷
- 重庆市九龙坡区七校2016-2017学年上期八年级素质测查(二)语文学科试题卷
- 江苏省无锡市钱桥中学2016年12月八年级语文阶段性测试卷
- 江苏省无锡市钱桥中学2016-2017学年七年级英语12月阶段检测试卷
- 山东省邹城市第八中学2016-2017学年八年级12月物理第4章试题(无答案)
- 【人教版】河北省2015-2016学年度九年级上期末语文试题卷(附答案)
- 四川省简阳市阳安中学2016年12月高二月考英语试卷
- 四川省成都龙泉中学高三上学期2016年12月月考试题文科综合能力测试
- 安徽省滁州中学2016—2017学年度第一学期12月月考高三英语试卷
- 山东省武城县第二中学2016.12高一年级上学期第二次月考历史试题(必修一第四、五单元)
- 福建省四地六校联考2016-2017学年上学期第三次月考高三化学试卷
- 甘肃省武威第二十三中学2016—2017学年度八年级第一学期12月月考生物试卷
网友关注
- 2015军转必读:我国海拔最高的海关--中塔卡拉苏海关正式挂牌
- 参考题4
- 徐悲鸿《绿茵雄鸡》330万落槌
- 铅笔
- 钢琴即兴伴奏讲座2010.12.2
- 2015克佰克于孜小学校园文化建设实施方案
- “教”与“学”
- 感恩母亲
- 詹营小学篮球兴趣小组活动计划
- 教学相长
- 考试内容
- 慕课归程
- 2015年二级建造师考试试题及答案解析《机电实务》完整版1
- 英本1004微格教学实施方案16k
- 考试工作安排.doc
- 航道与引航选择题
- 普通话易错读字_免费
- 2014年第15届学术年会 实验课堂教学案例评审参考标准
- 基于以学论教的高中数学课堂_教师的导_浅谈_水菊芳
- 2015军转快讯:四川资阳市副市长、公安局局长陈正权涉嫌严重违纪违法被调查
- 普通话朗读作品 (50)
- 优质服务活动实施方案
- 评课稿
- 自主学习教学模式
- 数百件书画“名作” “乱真”堪称第一
- 模拟试卷4
- 博悦少儿钢琴,博悦技术
- 模拟试卷1
- 黑龙江省美术馆馆藏版画在京“画说龙江”
- 乘车 教学设计
网友关注视频
- 小学英语单词
- 19 爱护鸟类_第一课时(二等奖)(桂美版二年级下册)_T3763925
- 冀教版小学数学二年级下册第二单元《有余数除法的竖式计算》
- 19 爱护鸟类_第一课时(二等奖)(桂美版二年级下册)_T502436
- 【部编】人教版语文七年级下册《逢入京使》优质课教学视频+PPT课件+教案,安徽省
- 外研版英语七年级下册module3 unit2第二课时
- 沪教版牛津小学英语(深圳用) 六年级下册 Unit 7
- 沪教版八年级下册数学练习册21.4(1)无理方程P18
- 冀教版英语五年级下册第二课课程解读
- 苏科版数学 八年级下册 第八章第二节 可能性的大小
- 【部编】人教版语文七年级下册《老山界》优质课教学视频+PPT课件+教案,安徽省
- 外研版英语七年级下册module3 unit2第一课时
- 沪教版牛津小学英语(深圳用) 四年级下册 Unit 3
- 河南省名校课堂七年级下册英语第一课(2020年2月10日)
- 【部编】人教版语文七年级下册《泊秦淮》优质课教学视频+PPT课件+教案,广东省
- 第8课 对称剪纸_第一课时(二等奖)(沪书画版二年级上册)_T3784187
- 冀教版小学数学二年级下册第二周第2课时《我们的测量》宝丰街小学庞志荣
- 冀教版英语四年级下册第二课
- 沪教版牛津小学英语(深圳用) 五年级下册 Unit 7
- 8.练习八_第一课时(特等奖)(苏教版三年级上册)_T142692
- 飞翔英语—冀教版(三起)英语三年级下册Lesson 2 Cats and Dogs
- 青岛版教材五年级下册第四单元(走进军营——方向与位置)用数对确定位置(一等奖)
- 二年级下册数学第一课
- 化学九年级下册全册同步 人教版 第18集 常见的酸和碱(二)
- 冀教版小学数学二年级下册第二周第2课时《我们的测量》宝丰街小学庞志荣.mp4
- 【部编】人教版语文七年级下册《逢入京使》优质课教学视频+PPT课件+教案,辽宁省
- 七年级英语下册 上海牛津版 Unit5
- 【部编】人教版语文七年级下册《逢入京使》优质课教学视频+PPT课件+教案,安徽省
- 30.3 由不共线三点的坐标确定二次函数_第一课时(市一等奖)(冀教版九年级下册)_T144342
- 六年级英语下册上海牛津版教材讲解 U1单词
精品推荐
- 2016-2017学年高一语文人教版必修一+模块学业水平检测试题(含答案)
- 广西钦州市高新区2017届高三11月月考政治试卷
- 浙江省湖州市2016-2017学年高一上学期期中考试政治试卷
- 浙江省湖州市2016-2017学年高二上学期期中考试政治试卷
- 辽宁省铁岭市协作体2017届高三上学期第三次联考政治试卷
- 广西钦州市钦州港区2016-2017学年高二11月月考政治试卷
- 广西钦州市钦州港区2017届高三11月月考政治试卷
- 广西钦州市钦州港区2016-2017学年高一11月月考政治试卷
- 广西钦州市高新区2016-2017学年高二11月月考政治试卷
- 广西钦州市高新区2016-2017学年高一11月月考政治试卷
分类导航
- 互联网
- 电脑基础知识
- 计算机软件及应用
- 计算机硬件及网络
- 计算机应用/办公自动化
- .NET
- 数据结构与算法
- Java
- SEO
- C/C++资料
- linux/Unix相关
- 手机开发
- UML理论/建模
- 并行计算/云计算
- 嵌入式开发
- windows相关
- 软件工程
- 管理信息系统
- 开发文档
- 图形图像
- 网络与通信
- 网络信息安全
- 电子支付
- Labview
- matlab
- 网络资源
- Python
- Delphi/Perl
- 评测
- Flash/Flex
- CSS/Script
- 计算机原理
- PHP资料
- 数据挖掘与模式识别
- Web服务
- 数据库
- Visual Basic
- 电子商务
- 服务器
- 搜索引擎优化
- 存储
- 架构
- 行业软件
- 人工智能
- 计算机辅助设计
- 多媒体
- 软件测试
- 计算机硬件与维护
- 网站策划/UE
- 网页设计/UI
- 网吧管理