improved tlbo and jaya algorithms to solve new fuzzy flexible job-shop scheduling problems

Flexible job-shop scheduling problem (fjsp) finds significant interest in the field of scheduling in dealing with complexity, solution methodology and, industrial applications. however, most of the studies on fjsp, consider the processing time of operations to be deterministic and known at priori while solving the problem. since uncertainty is bound to occur in industries, deterministic approaches for solving fjsp may not yield good solutions. schedules generated considering uncertainties may help the manufacturing firms to handle the uncertainties efficiently. the present work aims at solving fjsp in a realistic manner, considering uncertainty in the processing times. a modified version of optimization algorithms without tuning parameters such as teaching-learning-based optimization (tlbo) and jaya is proposed to solve fuzzy fjsp (ffjsp) with less computational burden. although there are enough challenging benchmark problems for deterministic fjsp problems, only limited benchmarks are available for a fuzzy variant of fjsp. the currently available ffjsp problems in the literature are small in size as compared to brandimate data instances which are widely accepted for a deterministic variant of fjsp. therefore, an attempt has been made in this paper to solve the instances of kacem’s and brandimarte’s by converting them into fuzzy fjsp. the present work also provides new challenging problems compared to the existing benchmark problems to study ffjsp.