...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of Scheduling >The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers
【24h】

The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers

机译：灵活的行程分配问题，适用于大型巡回行程安排问题，并应用于机场地面服务人员

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

获取外文期刊封面封底 >>

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

摘要

The paper examines the complexity of assigning multiple breaks to shifts in the context of large-scale tour scheduling. A mixed-integer programming (MIP) model is presented that includes shift and days-off scheduling along with break assignments for a multi-skilled workforce. To achieve tractability, a two-stage decomposition procedure is proposed that separates the tour scheduling problem (TShP) from the break assignment problem (BAP). The former MIP is first solved to determine the shifts and days off for the workforce that minimize labor and shortages costs over the planning horizon. The results are used as input to a second MIP that optimally places the breaks to minimize the costs of working hours and uncovered periods. Three implicit BAP formulations are investigated. To better understand the literature and the models previously developed, a 3-field break classification scheme is introduced. The first field characterizes the number of breaks permitted per shift, the second specifies whether the length of the breaks is fixed or variable, and the third limits their position in a shift. A complexity analysis of the resulting 12 BAPs along with a few special cases is also included. Most problems are shown to be strongly NP-hard. Computations are presented for a wide variety of scenarios for both the TShP and the BAP using data provided by a European airport ground handler company. In all, over 500 instances were investigated using high and low demand fluctuation curves and the various break and shift flexibility options. The results indicate that increasing flexibility in break regulations can make a significant difference in coverage, but the degree depends on the underlying structure of the demand curve as well as on the types of shifts permitted. Formulations with the most flexible shift and break regulations reduced undercoverage by up to 16.68% compared to the most common scenarios in which shifts are limited to a single lunch break.
机译：本文研究了在大规模巡回行程安排中为班次分配多个休息的复杂性。提出了一种混合整数编程（MIP）模型，该模型包括轮班和休息日计划以及针对多技能劳动力的休息时间分配。为了实现可处理性，提出了一个两阶段分解过程，该过程将行程安排问题（TShP）与休息分配问题（BAP）分开。首先解决了以前的MIP，以确定劳动力的轮班和休息日，以最大程度地减少计划范围内的劳动力和短缺成本。结果用作第二个MIP的输入，第二个MIP可以最佳地安排休息时间，以最大程度地减少工作时间和工作时间的成本。研究了三种隐式BAP公式。为了更好地理解文献和先前开发的模型，引入了3场中断分类方案。第一个字段表示每个班次允许的休假数量，第二个字段指定休假的长度是固定的还是可变的，第三个字段限制其在班次中的位置。还包括对所得的12个BAP的复杂性分析以及一些特殊情况。大多数问题显示出对NP的要求很高。使用欧洲机场地面服务公司提供的数据，为TShP和BAP提供了针对各种场景的计算。使用高和低需求波动曲线以及各种休息和换班灵活性选项，总共调查了500多个实例。结果表明，提高休息规则的灵活性可以在覆盖范围上产生显着差异，但是程度取决于需求曲线的基础结构以及允许的班次类型。与最常见的将轮班限制为一次午餐休息的情况相比，具有最灵活的轮班和休息时间规定的配方可将不足率降低多达16.68％。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号