.png){kind=icon}
Return
An immune-based algorithm for the multi-maintenance with sequential operations
.png){kind=icon}
PRE
AI
DOI：10.3233/jifs-189590.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this study, we investigate a new multi-maintenance with sequential operation (MMSO) problem, in which a variety of tasks must be processed on multiple machines. In the MMSO problem, each task has multiple sequential operations that must be processed for each machine. In addition to maintenance, the MMSO problem has many other practical applications, such as physical examination scheduling. The proposed MMSO, which is an NP-hard problem, generalizes typical job shop scheduling problems. Thus, a novel encoding scheme, which is embedded into an immune-based algorithm (IBA), is proposed in this study to convert any sequence of random numbers into a feasible solution of the MMSO problem to solve the MMSO problem. Numerical results of applications in aircraft maintenance and physical examination scheduling are reported and compared with those of particle swarm optimization and genetic algorithm. Experimental results show that IBA outperforms the two other algorithms.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available