arrow
返回

Harmony search algorithm for single-machine scheduling problem with planned maintenance

delete2014-10-01
delete46
PRE
AI
F
Francesco Zammori *
M
Marcello Braglia
D
Davide Castellano
DOI:10.1016/j.cie.2014.08.001delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper focuses on the single machine scheduling problem, with sequence dependent setup times. Both processing and setup times are deterministic and the objective is to minimize total earliness and tardiness penalties. The novelty of the model can be traced in the fact that the single machine is subjected to breakdowns and that, in order to increase its availability, planned maintenance tasks are also performed. Hence, jobs and maintenance tasks are jointly considered to find the optimal schedule. These features make the problem NP-hard and so, a quasi-optimal solution is searched using a recent metaheuristic, which integrates harmony search and genetic algorithms. In order to validate the proposed metaheuristic, a comprehensive set of scheduling problems was fully investigated. Obtained results, compared with those of exhaustive (for small problems) and standard metaheuristics, confirm both the robustness and the speed of the proposed approach. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Earliness-tardiness penalties
Harmony search
Metaheuristics
Planned maintenance
Scheduling
Single machine
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Computers and Industrial Engineering 封面图
Computers and Industrial Engineering
IF:
6.5
论文数:
1.0W
被引数:
3.8W

机构

U
University of Parma
学者数:
1.7W
论文数: 1.3W
被引数: 1.3W
U
University of Pisa
学者数:
3.1W
论文数: 2.4W
被引数: 2.4W
引用论文

引用论文

Impact of prolonged sitting on lower and upper limb micro‐ and macrovascular dilator function
err2015-06-10
err0
errOAAI
errRobert M. Restaino; Seth W. Holwerda; Daniel P. Credeur; Paul J. Fadel; Jaume Padilla
err分享
err收藏
err分享
err收藏
学者 查看更多内容