首页> 美国卫生研究院文献>PLoS Clinical Trials >Bi-Objective Flexible Job-Shop Scheduling Problem Considering Energy Consumption under Stochastic Processing Times
【2h】

Bi-Objective Flexible Job-Shop Scheduling Problem Considering Energy Consumption under Stochastic Processing Times

机译:随机处理时间下考虑能耗的双目标柔性作业车间调度问题

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

This paper presents a novel method on the optimization of bi-objective Flexible Job-shop Scheduling Problem (FJSP) under stochastic processing times. The robust counterpart model and the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are used to solve the bi-objective FJSP with consideration of the completion time and the total energy consumption under stochastic processing times. The case study on GM Corporation verifies that the NSGA-II used in this paper is effective and has advantages to solve the proposed model comparing with HPSO and PSO+SA. The idea and method of the paper can be generalized widely in the manufacturing industry, because it can reduce the energy consumption of the energy-intensive manufacturing enterprise with less investment when the new approach is applied in existing systems.
机译:本文提出了一种在随机处理时间下优化双目标柔性作业车间调度问题的新方法。考虑到完成时间和随机处理时间下的总能耗,使用鲁棒的对应模型和非支配排序遗传算法II(NSGA-II)来求解双目标FJSP。通用汽车公司的案例研究证明,与HPSO和PSO + SA相比,本文使用的NSGA-II是有效的,并且具有解决所提出模型的优势。本文的思想和方法可以在制造业中广泛推广,因为当在现有系统中采用这种新方法时,它可以用较少的投资减少高耗能制造企业的能耗。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号