工业工程英文文献及外文翻译(2)

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 . 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 /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.

工业工程专业英文文献,外文翻译

附录2：中文文献

生产线平衡在现实世界

摘要：生产线平衡（LB）是一个经典的，精心研究的显著工业重要性的运筹学（OR）优化问题。这是其中一个所在领域的专业知识并没有太大帮助的问题之一：无论花了多少年解决它，面对每一次棘手的问题与可能的天文数字的解决方案都并不是关于如何解决这个问题的最好办法，除非你假定老办法是最好的办法。在这里，我们解释一个明显的悖论：虽然很多算法已经被提出，在过去，尽管该问题的实际重要性只是一个市场销售的LB软件。目前似乎可用于工业，如汽车中的应用。我们推测，这可能是由于在学术LB问题之间的没有通过运筹学路径和生产业实际面对的问题。

关键词：生产线平衡，装配生产线，优化

工业工程专业英文文献,外文翻译

生产线平衡在现实世界

伊曼纽尔 福肯奈尔

优化设计

地址：珍妮大道19A，2道，B-1050布鲁塞尔，比利时

+32（0）2 646 10 74

E.Falkenauer@

1 引言

装配线平衡，或者简称生产线平衡（LB），是一个操作工作站沿着装配线分配的问题，在这样一种方式，该分配是在某种意义上最优的。自从亨利 福特引进组装生产线， LB 已经成为影响工业重要性的最优化问题：在效率不同的最优和次优分配之间的差异可以产生经济（或浪费）达到数百万美元每年。 LB是一个经典的运筹学（OR）的优化 …… 此处隐藏：4975字，全部文档内容请下载后查看。喜欢就下载吧 ……