.png){kind=icon}
返回
Single machine scheduling with periodic machine availability
.png){kind=icon}
OA
AI
DOI：10.1016/j.cie.2018.06.025.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we address the problem of scheduling jobs on a single machine with cyclical machine availability periods. In this problem, the scheduling horizon is composed of periods where the machine is available followed by other periods where no operation can be performed. In the literature, the problem is denoted as scheduling with periodic maintenance, as it is usually assumed that these unavailability periods are employed to perform maintenance activities. Another situation is the one inspiring our research, i.e. the need of completing manufacturing operations within a shift. More specifically, we focus the single machine scheduling problem with makespan objective subject to periodic machine availability. There are several contributions proposing approximate procedures due to the NP-hardness shown for the problem. However, we are not aware of a computational evaluation among these procedures. Furthermore, the problem is similar to the classical bin packing problem, so it is of interest to explore the relation between both problems. In this paper, we address these two issues, and propose new approximate solution procedures for the problem.
Keyword:
Single machine scheduling
Makespan
Heuristics
Periodic maintenance
Periodic machine availability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
Integrity and Authentications for service security in vehicular ad hoc networks (VANETs): A Review
PREAI
分享收藏
查看更多内容