Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives

Flexible job-shop scheduling problem (fjsp) is a practically useful extension of the classical job shop scheduling problem. this paper proposes an effective discrete harmony search (dhs) algorithm to solve fjsp. the objectives are the weighted combination of two minimization criteria namely, the maximum of the completion time (makespan) and the mean of earliness and tardiness. firstly, we develop a new method for the initial machine assignment task. some existing heuristics are also employed for initializing the harmony memory with discrete machine permutation for machine assignment and job permutation for operation sequencing. secondly, we develop a new rule for the improvisation to produce a new harmony for fjsp incorporating machine assignment and operation sequencing. thirdly, several local search methods are embedded to enhance the algorithm’s local exploitation ability. finally, extensive computational experiments are carried out using well-known benchmark instances. computational results and comparisons show the efficiency and effectiveness of the proposed dhs algorithm for solving the fjsp with weighted combination of two objectives.