首页> 外文期刊>哈尔滨工业大学学报(英文版) >An Optimization Method for a Single Machine Multi-family Scheduling Problem with Qualification Run Constraints
【24h】

An Optimization Method for a Single Machine Multi-family Scheduling Problem with Qualification Run Constraints

机译:有资格运行约束的单机多家庭调度问题的优化方法

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

摘要

The qualification run(qual-run)as a technique to avoid possible quality problems of products inevitably leads to much longer cycle time.To effectively balance the trade-off between the qual-run and setup times, a scheduling model of a single machine with multiple families was developed and an adaptive differential evolution algorithm based on catastrophe with depth neighborhood search was applied to resolve the problem. First,a scheduling problem domain was described,and a mathematical programming model was set up with an objective of minimizing makespan. Further, several theorems were developed to construct feasible solutions. On the basis of differential evolution,the depth neighborhood search operator was adopted to search a wide range of solutions.In addition,the adaptive process and catastrophe theory were combined to improve the performance of the algorithm. Finally, simulation experiments were carried out and the results indicated that the proposed algorithm was effective and efficient.
机译:验证运行(qual-run)作为一种避免产品可能出现质量问题的技术不可避免地会导致更长的周期时间。为了有效地平衡均衡运行和设置时间之间的权衡,单机的调度模型具有开发了多个族,并应用了基于灾难和深度邻域搜索的自适应差分进化算法来解决该问题。首先,描述了调度问题域,并建立了以最小化制造时间为目标的数学编程模型。此外,开发了几个定理以构造可行的解决方案。在差分演化的基础上,采用深度邻域搜索算子搜索了广泛的解。此外,将自适应过程和突变理论相结合,提高了算法的性能。最后进行了仿真实验,结果表明该算法是有效的。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号