A self-tuning PSO for job-shop scheduling problems

From previously published literature, there is a well-behaved PSO variant developed for the job-shop scheduling problem. In order to construct its parameterised active schedules, this PSO uses an important input parameter controlling the maximum delay times allowed for each operation in the job-shop schedules. This research aims to enhance the performance of this algorithm by adding the ability of self-fine-tuning parameter's value into this PSO. Thus, the developed PSO can fine-tune its own parameter value proper to a particular job-shop scheduling problem during its computational time without any human support. From the numerical experiment, this new PSO algorithm performs better than the original PSO without additional computational time.