Applied-information technology and data processing for multi-objective interval job shop scheduling problem with flexible preventive maintenance

摘要

Interval job shop scheduling problem with flexible preventive maintenance is considered and an multi-objective swarm-based neighborhood search (MOSNS) is proposed for minimizing interval makespan and total interval tardiness. A dominance based greedy principle is utilized to decide if the old solution is replaced with the new one. A solution with the highest rank is replaced with a randomly chosen member of the non-dominated set every few number of iterations. Computational results show that MOSNS is an effective approach to solve the considered problem.