• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >Multi-objective production scheduling with controllable processing times and sequence-dependent setups for deteriorating items
【24h】

Multi-objective production scheduling with controllable processing times and sequence-dependent setups for deteriorating items

机译：具有可控制的处理时间和与序列有关的设置的多目标生产计划，用于恶化的项目

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

摘要

The production scheduling problem is to find simultaneously the lot sizes and their sequence over a finite set of planning periods. This paper studies a single-stage production scheduling problem subject to controllable process times and sequence-dependent setups for deteriorating items. The paper formulates the problem by minimising two objectives of total costs and total variations in production volumes simultaneously. The problem is modelled and analysed as a mixed integer nonlinear program. Since it is proved that the problem is NP-hard, a problem-specific heuristic is proposed to generate a set of Pareto-optimal solutions. The heuristic is investigated analytically and experimentally. Computational experiences of running the heuristic and non-dominated sorting genetic algorithm-I over a set of randomly generated test problems are reported. The heuristic possesses at least 56.5% (in the worst case) and at most 94.7% (in the best case) of total global Pareto-optimal solutions in ordinary-size instances.
机译：生产计划的问题是在一组有限的计划周期内同时找到批量大小及其顺序。本文研究了单阶段生产调度问题，该问题受制于可控制的处理时间和恶化物品的依序设置的问题。本文通过将总成本和总产量的同时变化的两个目标最小化来解决这个问题。该问题被建模和分析为混合整数非线性程序。由于已证明问题是NP难的，因此提出了针对特定问题的启发式方法，以生成一组帕累托最优解。启发式进行了分析和实验研究。报告了在一组随机生成的测试问题上运行启发式和非主导排序遗传算法-I的计算经验。在普通大小的情况下，启发式算法拥有总的全局Pareto最优解的至少56.5％（最坏的情况）和最多94.7％（最坏的情况）。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号