.png){kind=icon}
返回
Robust single machine scheduling with a flexible maintenance activity
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2019.03.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we address a problem arising in a manufacturing environment concerning the joint scheduling of multiple jobs and a maintenance activity on a single machine. Such activity must be processed within a given time window and its non-deterministic duration takes values in a given interval. We seek job schedules which are robust to any possible changes in the maintenance activity duration. We consider makespan and total completion time objectives under four different robustness criteria. We discuss a few properties and the complexity of finding robust schedules for the resulting eight problem scenarios. For the case of total completion time objective and maximum absolute regret criterion, we design and test exact and heuristic algorithms. The results of an extensive computational campaign, performed for assessing the performance of the proposed solution approaches, are reported. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Scheduling
Flexible maintenance
Robust optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Effects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
.png){kind=icon}
PREAI
分享收藏分享收藏Single machine total completion time scheduling problem with workload-dependent maintenance duration
PREAI
分享收藏Scheduling assembly tasks with caterpillar precedence constraints on dedicated machines在专用机器上使用caterpillar优先约束调度装配任务
PREAI
分享收藏
查看更多内容