...
首页> 外文期刊>International Journal of Production Research >Optimal versus heuristic scheduling of surface mount technology lines
【24h】

Optimal versus heuristic scheduling of surface mount technology lines

机译:表面贴装技术生产线的最优与启发式调度

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

摘要

This paper presents and compares an exact and a heuristic approach for scheduling of printed wiring board assembly in surface mount technology (SMT) lines. A typical SMT line consists of several assembly stations in series and/or in parallel, separated by finite intermediate buffers. The objective of the scheduling problem is to determine the detailed sequencing and timing of all assembly tasks for each individual board, so as to maximize the line's productivity, which is defined in terms of makespan for a mix of board types. The limited intermediate buffers between stations result in a scheduling problem with machine blocking, where a completed board may remain on a machine and block it until a downstream machine becomes available. In addition, limited machine availability due to scheduled downtimes is considered. The exact approach is based on a mixed integer programming formulation that can be used for optimization of assembly schedules by using commercially available software for integer programming, whereas the heuristic approach is designed as a combination of tabu search and a set of dispatching rules. Numerical examples modelled after real-world SMT lines and some computational results are provided to illustrate and compare the two approaches.
机译:本文介绍并比较了在表面安装技术(SMT)生产线中安排印刷线路板组装的精确和启发式方法。典型的SMT生产线由数个串联和/或并联的装配工位组成,并由有限的中间缓冲区隔开。计划问题的目的是确定每个单独板子的所有组装任务的详细顺序和时间,以便最大化生产线的生产率,这是根据混合板种的制造时间来定义的。工作站之间有限的中间缓冲区会导致机器阻塞的调度问题,在此情况下,完成的板可能会留在机器上并阻塞直到下游机器可用为止。另外,考虑到由于计划的停机时间而限制了机器的可用性。确切的方法是基于混合整数编程公式,该公式可通过使用可商购的整数编程软件来优化装配计划,而启发式方法被设计为禁忌搜索和一组调度规则的组合。提供了以实际SMT线为模型的数值示例以及一些计算结果,以说明和比较这两种方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号