• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Scheduling flexible flowshops with sequence-dependent setup times.
【24h】

Scheduling flexible flowshops with sequence-dependent setup times.

机译：使用与序列相关的建立时间安排灵活的流水车间。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This dissertation addresses the scheduling problem in a flexible flowshop with sequence-dependent setup times. The production line consists of S production stages, each of which may have more than one non-identical (uniform) machines. Prior to processing a job on a machine at the first stage, a setup time from idling is needed. Also sequence dependent setup times (SDST) are considered on each machine in each stage. The objective of this research is to minimize the makespan. A mathematical model was developed for small size problems and two heuristic algorithms (Flexible Flowshop with Sequence Dependent Setup Times Heuristic (FFSDSTH) and Tabu Search Heuristic (TSH)) were developed to solve larger, more practical problems. The FFSDSTH algorithm was developed to obtain a good initial solution which can then be improved by the TSH algorithm. The TSH algorithm uses the well-known Tabu Search metaheuristic. In order to evaluate the performance of the heuristics, two lower bounds (Forward and Backward) were developed. The machine waiting time, idle time, and total setup and processing times on machines at the last stage were used to calculate the lower bound. Computational experiments were performed with the application of the heuristic algorithms and the lower bound methods. Two quantities were measured: (1) the performance of the heuristic algorithms obtained by comparing solutions with the lower bounds and (2) the relative improvement realized with the application of the TSH algorithm to the results obtained with the FFSDSTH algorithm. The performance of the heuristics was evaluated using two measures: solution quality and computational time. Results obtained show that the heuristic algorithms are quite efficient. The relative improvement yielded by the TSH algorithm was between 2.95 and 11.85 percent.
机译：本文针对具有顺序依赖的建立时间的柔性流水车间解决了调度问题。该生产线由 S 生产阶段组成，每个阶段可能具有不止一台不相同的（统一）机器。在第一阶段在机器上处理作业之前，需要从空闲开始的准备时间。在每个阶段的每台机器上还要考虑与序列有关的建立时间（SDST）。这项研究的目的是使制造期最小化。针对小尺寸问题开发了数学模型，并开发了两种启发式算法（具有顺序依赖的建立时间启发式的灵活Flowshop（FFSDSTH）和禁忌搜索启发式（TSH））来解决更大，更实际的问题。开发了FFSDSTH算法以获得良好的初始解，然后可以通过TSH算法对其进行改进。 TSH算法使用著名的禁忌搜索元启发式算法。为了评估启发式算法的性能，开发了两个下限（向前和向后）。最后阶段的机器等待时间，空闲时间以及机器上的总设置和处理时间用于计算下限。应用启发式算法和下界方法进行计算实验。测量了两个数量：（1）通过比较下限解获得的启发式算法的性能，以及（2）将TSH算法应用于FFSDSTH算法获得的结果实现的相对改进。启发式方法的性能使用两种方法进行评估：解决方案质量和计算时间。获得的结果表明，启发式算法非常有效。 TSH算法产生的相对改进在2.95％至11.85％之间。

著录项

  • 作者

    Sethanan, Kanchana.;

  • 作者单位

    West Virginia University.;

  • 授予单位 West Virginia University.;
  • 学科 Engineering Industrial.
  • 学位 Ph.D.
  • 年度 2001
  • 页码 181 p.
  • 总页数 181
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 一般工业技术;
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号