The Equipment Scheduling and Assignment Problem in the Overhaul Industry

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

In this article, equipment overhaul is considered in a multi-stage flow shop scheduling problem. In this problem, the equipments are disassembled in the first stage, overhaul and repairs are done on the equipment in parallel workshops in the second stage, and the assembly operation is done in parallel workshops in the third stage. Considering a three-stage overhaul with parallel machines in the second and third stages is new in the overhaul industry. The sequence of equipment processing is determined in the first stage, as well as the allocation and sequence of equipment in the second and third stages should be done in such a way that the total completion time of jobs is minimized. Unlike most articles, the sequence of processing jobs is not the same in all stages and changes with the use of decoding. For the next innovation: in order to solve the problem, a new mathematical model is presented. Two new improved algorithms, Genetic Algorithms (GA) and Particle Swarm Optimization (PSO) are presented to solve the problem in large dimensions. By using the shortest processing time (SPT) heuristic, these two algorithm have been improved and Hybrid GA (HGA) and Hybrid PSO (HPSO) algorithms have been presented. In order to achieve better results with the current conditions, the parameters setting is done by one-way analysis of variance (ANOVA). Finally, it is possible to improve the performance of the equipment by applying the discussed issues.

Cite

CITATION STYLE

APA

Torkashvand, M., Shamami, N., & Bigdeli, H. (2023). The Equipment Scheduling and Assignment Problem in the Overhaul Industry. International Journal of Engineering, Transactions B: Applications, 36(6), 1150–1165. https://doi.org/10.5829/ije.2023.36.06c.14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free