arrow
返回

Two-machine scheduling with aging effects and variable maintenance activities

delete2021-10-01
delete9
PRE
AI
H
Hesham K. Alfares *
A
Awsan Mohammed
M
Mustafa Ghaleb
DOI:10.1016/j.cie.2021.107586delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper presents models and solution algorithms for a two-machine scheduling problem with positiondependent job processing times subject to both aging and maintenance effects. Aiming to minimize the overall makespan for two identical parallel machines, two cases are analyzed. In the first case, no maintenance is scheduled. In the second case, maintenance is scheduled within the job processing sequence, restoring the machine to as-new condition. Assuming the number and the positions of maintenance stops to be variable, machine maintenance and job processing are scheduled simultaneously. Integer linear programming (ILP) models are formulated to determine the optimal maintenance and job processing sequence on each machine. To solve largesize problems, six heuristic solution methods are developed and compared. The maximum delay penalty (MDP) heuristic is best for the no-maintenance case, while the variable neighborhood search (VNS) metaheuristic is best for the with-maintenance case. Both methods quickly produce near-optimal solutions for large-size problems.
Keyword:
Machine scheduling
Maintenance scheduling
Aging effect
Integer linear programming
Heuristic algorithms
Variable neighborhood search
AI总结

AI总结

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

期刊

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

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
学者 查看更多内容