...
首页> 外文期刊>European Journal of Operational Research >Flow-shop scheduling with setup and assembly operations
【24h】

Flow-shop scheduling with setup and assembly operations

机译:具有设置和组装操作的流水车间调度

获取原文
获取原文并翻译 | 示例
           

摘要

A scheduling model for a production system including machining, setup and assembly operations is considered. Production of a number of single-item products is ordered. Each product is made by assembling a set of several different parts. First, the parts are manufactured in a flow-shop consisting of multiple machines. Then, they are assembled into products on a single assembly stage. Setup operation and setup time are needed when a machine starts processing the parts or it changes items. The operations are partitioned into several blocks. Each block consists of the machining operations, the setup operations.. and the assembly operation(s) for one or several products. The parts of the same item in a block are processed successively. The objective function is the mean completion time for all products. We consider a problem to partition the operations into blocks and sequence the parts in each block so as to minimize the objective function. Solution procedures using pseudo-dynamic programming and a branch-and-bound method are proposed. Computational experiments are carried out to evaluate the performance of the solution procedures. It has been found that a good near-optimal schedule is obtained efficiently by the proposed solution procedures. (C) 2006 Elsevier B.V. All rights reserved.
机译:考虑用于生产系统的调度模型,包括机加工,设置和组装操作。订购许多单项产品。每个产品都是通过组装几个不同的零件而制成的。首先,零件是在由多台机器组成的流水车间中制造的。然后,在一个组装阶段将它们组装成产品。机器开始加工零件或更改项目时,需要进行设定操作和设定时间。这些操作分为几个块。每个模块由一个或多个产品的机加工操作,设置操作..和组装操作组成。块中同一项目的各个部分将被连续处理。目标函数是所有产品的平均完成时间。我们考虑将操作划分为多个块并对每个块中的各个部分进行排序以最小化目标函数的问题。提出了使用伪动态规划和分支定界法的求解程序。进行计算实验以评估求解程序的性能。已经发现,通过所提出的解决方法有效地获得了良好的接近最佳的时间表。 (C)2006 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号