...
首页> 外文期刊>Procedia CIRP >Lagrangian Relaxation for Stochastic Disassembly Line Balancing Problem
【24h】

Lagrangian Relaxation for Stochastic Disassembly Line Balancing Problem

机译:拉格朗日放松随机拆卸线平衡问题

获取原文
           

摘要

This study deals with the problem of profit oriented disassembly line balancing considering partial disassembly, presence of hazardous parts and uncertainty of task times. The objective of this paper is to design a serial line that obtains the maximum profit under uncertainty. Tasks of the best selected disassembly alternative are to be assigned to a sequence of workstations while respecting precedence and cycle time constraints. The line profit is computed as the difference between the positive revenue generated by the retrieved parts of the End of Life (EOL) product and the line operation cost. The latter includes the workstation operation costs and additional costs for handling hazardous parts. Task times are assumed to be random variables with known probability distributions. An AND/OR graph is used to model the disassembly alternatives and the precedence relationships among tasks and subassemblies. To cope with uncertainties, a solution method based on Lagrangian relaxation and Monte Carlo sampling technique is developed. To show the relevance and applicability of the proposed method, it is evaluated on a set of problem instances from the literature.
机译:本研究涉及考虑部分拆卸,存在危险部件和任务时间的不确定性的拆卸线路平衡问题。本文的目的是设计一种串行线,可在不确定性下获得最大利润。在尊重优先级和循环时间约束的同时将分配给出最佳所选择的拆卸替代的任务。该线利润被计算为寿命结束(EOL)产品的检索部分和线路运营成本所产生的正收入之间的差异。后者包括工作站运营成本以及处理危险部件的额外成本。任务时间被认为是具有已知概率分布的随机变量。 A和/或图形用于模拟任务和子组件之间的拆卸替代品和优先关系。为了应对不确定性,开发了一种基于拉格朗日放松和蒙特卡罗采样技术的解决方案方法。为了展示所提出的方法的相关性和适用性,它在文献中的一组问题实例上进行了评估。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号