...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >Flexible job-shop scheduling with flexible workdays, preemption, overlapping in operations and satisfaction criteria: an industrial application
【24h】

Flexible job-shop scheduling with flexible workdays, preemption, overlapping in operations and satisfaction criteria: an industrial application

机译：灵活的车间计划，具有灵活的工作日，优先权，重复运营和满意度标准：工业应用

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

摘要

This paper addresses a real scheduling problem, namely, a complex flexible job-shop scheduling problem (FJSP) with special characteristics (flexible workdays, preemption and overlapping in operations), where the objective is to maximise a satisfaction criterion defined through goal programming. To allow for flexible workdays, the solution representation of the classical FJSP is extended to consider overtime decisions and a sequence of time-cell states, which is used to model resource capability. A new temporal-constraint-handling method is proposed to solve the problem of overlapping in operations in a flexible-workday environment. Three solution methods are proposed to solve this scheduling problem: a heuristic method based on priority rules, a goal-guided tabu search (GGTS) and an extended genetic algorithm (EGA). In the GGTS, the neighbourhood functions are defined based on elimination approaches, and five possible neighbourhood functions (N0?N1?N2?N3?N4) are presented. The effectiveness and efficiency of the three solution methods are verified using dedicated benchmark instances. Computational simulations and comparisons indicate that the proposed N4-based GGTS demonstrates performance competitive with that of the EGA and the GGTSs based on the other neighbourhood functions (N0, N1, N2 and N3) for solving the scheduling problem.
机译：本文解决了一个真正的调度问题，即具有特殊特征（灵活的工作日，抢占和操作重叠）的复杂的灵活的车间调度问题（FJSP），其目标是最大化通过目标编程定义的满意度标准。为了允许灵活的工作日，对经典FJSP的解决方案表示进行了扩展，以考虑加班决策和一系列时间单元状态，用于对资源能力进行建模。提出了一种新的时间约束处理方法，以解决在灵活工作日环境下操作重叠的问题。提出了三种解决方案来解决该调度问题：基于优先级规则的启发式方法，目标制导禁忌搜索（GGTS）和扩展遗传算法（EGA）。在GGTS中，基于消除方法定义邻域函数，并提出了五个可能的邻域函数（N0→N1→N2→N3→N4）。使用专用的基准实例验证了这三种解决方案方法的有效性和效率。计算仿真和比较表明，所提出的基于N4的GGTS表现出与EGA和基于其他邻域函数（N0，N1，N2和N3）的GGTS竞争的性能，从而解决了调度问题。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号