Variable neighbourhood search for dual-resource constrained flexible job shop scheduling

AbstractDual-resource constrained flexible job shop scheduling problem (FJSP) is considered and an effective variable neighbourhood search (VNS) is presented, in which the solution to the problem is indicated as a quadruple string of the ordered operations and their resources. Two neighbourhood search procedures are sequentially executed to produce new solutions for two sub-problems of the problem, respectively. The search of VNS is restarted from a slightly perturbed version of the current solution of VNS when the determined number of iterations is reached. VNS is tested on some instances and compared with methods from literature. Computational results show the significant advantage of VNS on the problem.Keywords: variable neighbourhood searchdual resourceflexible job shop scheduling