Robust scheduling for multi-objective flexible job-shop problems with flexible workdays. Issue 11 (1st November 2016)

• Record Type: Journal Article
• Authors: Zhang, Jiae; Yang, Jianjun; Zhou, Yong
• Is Part Of: Engineering optimization. Volume 48:Issue 11(2016)
• Page Start: 1973
• Page End: 1989
• Publication Date: 2016-11-01
• Subjects: robust scheduling -- multi-objective flexible job shop -- flexible workdays -- goal-guided multi-objective search; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2016.1145216
• Languages: English
• ISSNs: 0305-215X

Abstract

Abstract : 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.