返回
Approximation algorithms for k-unit cyclic solutions in robotic cells
DOI:10.1016/j.ejor.2003.09.013.png)
摘要
En 中文
This paper considers the problem of scheduling operations in bufferless robotic cells that produce identical parts. Finding a multi-unit cyclic solution which minimizes the long-run average time to produce a part is an open problem. Most research has been focused on finding an optimal 1-unit cyclic solution. However, it is known that an optimal multi-unit cyclic solution can be better than an optimal 1-unit cyclic solution for cells with four or more machines. We present polynomial algorithms that produce multi-unit cyclic solutions whose per unit cycle times are within a constant factor of the Optimum for the three most common classes of robotic cells viz., additive, constant, and Euclidean travel-time. The approximation guarantees obtained for these three classes of cells are 1.5, 1.5, and 4, respectively. As a by-product, we obtain tipper bounds on the difference in the per unit cycle times between an optimal multi-unit cycle and an optimal 1-unit cycle for each of these three classes of cells. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
robotic cells
manufacturing
cyclic solutions
flexible manufacturing
heuristics
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Electro‐Microfluidics: Biomimetic Meta‐Structured Electro‐Microfluidics (Adv. Funct. Mater. 51/2019)
Rapid improvement of coagulopathy by all‐trans retinoic acid in acute promyelocytic leukemia全反式维甲酸快速改善急性早幼粒细胞白血病凝血功能
The healing of N-vacancy in boron nitride nanotube by using NO and NO2 molecules: a density functional theoretical study利用NO和NO2分子修复氮化硼纳米管中N空位的密度泛函理论研究
RSC Advances
IF0

