Robust scheduling for multi-objective flexible job-shop problems with flexible workdays

2016-02-19T09:22:52Z (GMT) by Jiae Zhang Jianjun Yang Yong Zhou

This study determines a robust schedule for a flexible job-shop scheduling problem with flexible workdays. The performance criteria considered in this study are tardiness, overtime and robustness. Furthermore, the problem is addressed in a Pareto manner, and a set of Pareto-optimal solutions is determined for this purpose. In consideration of all the aforementioned features, a goal-guided neighbourhood function is proposed based on efficient problem-dependent move-filtering methods. Two metaheuristic algorithms, named goal-guided multi-objective tabu search and goal-guided multi-objective hybrid search, are proposed in this work based on this neighbourhood function. The effectiveness of these approaches is demonstrated via empirical studies.