...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Sonklanakarin Journal of Science and Technology >A memetic algorithm to minimize the total sum of earliness tardiness and sequence dependent setup costs for flow shop scheduling problems with job distinct due windows
【24h】

A memetic algorithm to minimize the total sum of earliness tardiness and sequence dependent setup costs for flow shop scheduling problems with job distinct due windows

机译：一种模因算法，可最大程度地减少具有工作区分到期窗口的流水车间调度问题的早期拖延和与序列相关的设置成本的总和

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The research considers the flow shop scheduling problem under the Just-In-Time (JIT) philosophy. There are n jobswaiting to be processed through m operations of a flow shop production system. The objective is to determine the job schedulesuch that the total cost consisting of setup, earliness, and tardiness costs, is minimized. To represent the problem, the IntegerLinear Programming (ILP) mathematical model is created. A Memetic Algorithm (MA) is developed to determine the propersolution. The evolutionary procedure, worked as the global search, is applied to seek for the good job sequences. In order toconduct the local search, an optimal timing algorithm is developed and inserted in the procedure to determine the best schedule ofeach job sequence. From the numerical experiment of 360 problems, the proposed MA can provide optimal solutions for 355problems. It is obvious that the MA can provide the good solution in a reasonable amount of time.
机译：该研究考虑了准时制（JIT）理念下的流水车间调度问题。流水作业生产系统的m个操作要处理的工作有n个。目的是确定作业时间表，以使包括准备，早期和拖延成本在内的总成本最小化。为了表示问题，创建了IntegerLinear编程（ILP）数学模型。开发了一种模因算法（MA）来确定适当的解决方案。进化过程，作为全局搜索，被用来寻找好的工作序列。为了进行局部搜索，开发了一种最佳定时算法，并将其插入该过程中以确定每个作业序列的最佳调度。通过对360个问题的数值实验，提出的MA可以为355个问题提供最优的解决方案。显然，MA可以在合理的时间内提供良好的解决方案。

著录项

相似文献

  • 外文文献
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号