.png){kind=icon}
返回
A multi-level rescheduling approach for a dynamic remote operations scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2024.2408438.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we tackle a dynamic scheduling problem faced by a large international company. The problem involves assigning installation projects arriving over time to specialised technicians who execute them remotely. Each project consists of several tasks having processing times, release dates, and execution deadlines. The company needs to assign projects to technicians and schedule tasks complying with technicians' skills, precedence constraints between tasks, and tasks requiring multiple technicians simultaneously. The problem is dynamic as new projects and tasks become available over time, requiring their allocation to technicians. We formulate the offline problem as a mixed integer linear program that minimises the makespan, and we address the dynamic version solving restricted problems within a rolling horizon framework. The approach systematically implements different levels of schedule adjustment to incorporate new information. To study scalability, we validate our algorithm by using both real-world and synthetic simulations demonstrating its efficiency and effectiveness. Additionally, we provide interesting managerial insights for the company.
Keyword:
Periodic predictive-reactive rescheduling
rolling horizon
mixed-integer programming
makespan in parallel and identical machines
machine eligibility
schedule generation schemes
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation重新审视串行和并行资源受限的项目调度方法: 理论和计算
PREAI
分享收藏
查看更多内容