.png){kind=icon}
返回
A modified particle swarm optimization algorithm for a single-machine scheduling problem with periodic maintenance
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2010.02.075.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a particle swarm optimization (PSO) algorithm is presented to solve the single-machine scheduling problem with periodic maintenance activities. The most important issue for applying PSO algorithm successfully to the addressed scheduling problem is how to develop an effective 'problem mapping' and 'construction of a particle sequence' mechanism. For the problem mapping aspect, we apply the job-to-position representation for the particles. For the construction of a particle sequence aspect, we use the largest position value (LPV) rule. Besides, to enhance the effective of the proposed PSO algorithm, we embedded a restarting strategy and three stopping criteria. The objective is to find a schedule that minimizes the makespan. The addressed problem is shown to be NP-hard in the strong sense by transforming to the 3-partition problem. Computational results show that the proposed PSO-M algorithm is quite satisfactory on both solution accuracy and efficiency to solve the addressed problem. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Single-machine scheduling
Periodic maintenance
Nonresumable jobs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
A discrete version of particle swarm optimization for flowshop scheduling problems用于流水车间调度问题的粒子群优化算法的离散版本
PREAI
分享收藏
Preemptive scheduling with availability constraints to minimize total weighted completion times
PREAI
分享收藏
查看更多内容