|
CSME 2025/08
Volume 46 No.4
:
|
|
Flexible Job Shop Scheduling Problem with parallel batch machines to minimize total weighted flowtime with machine eligibility restrictions in automobile gear manufacturing industry
R. Murugesana*, M. Rajeshwarib, Praveena Kumara K.Ma and G. K. Jagatheswaric
aREVA University
bPresidency University
cPES University-EC Campus
|
Abstract:
In this article, we address a Flexible Shop Job Scheduling Problem with parallel batch processing machines for minimising total weighted flowtime that has been noticed in the production of automotive gears. Scheduling has specifically addressed the bottleneck functioning of the Pre heat treatment stage of the vehicle gear manufacturing process. Numerous real-world scenarios have been taken into account, including machine eligibility constraints, sequence-dependent setup delays, and unequal release times. Dynamic beginning conditions are taken into consideration using a mathematical model that has been suggested. It is determined that the scheduling problem is NP-hard and used the meta- heuristic algorithm that is a Modified Clonal Selection Algorithm by Positive Selection method (PSMCSA) have been offered as ways to approach the issue. The performance of the suggested algorithms is assessed based on planned computational experiments. The proposed heuristic algorithms may consistently produce solutions that are close to the optimal ones as calculated by statistics in an acceptable amount of time, according to extensive computational assessments.
|
|
Keywords: Flexible Shop Job Scheduling Problem with parallel batch machines; Positive selection based Modified Clonal Selection Algorithm; Gear Manufacturing.
|
Download PDF
|
©
2025
CSME , ISSN 0257-9731
|