摘要
In this paper we address multiobjective job shop scheduling problems. After several decades of research in scheduling problems, a variety of heuristics have been developed. The proposed algorithm is a hybrid of three frequently applied ones: the dispatching rule, the shifting bottleneck procedure, and the evolutionary algorithm. It is a two-stage algorithm, which integrates a rule-based memetic algorithm in the first stage and a re-optimization procedure of shifting bottleneck in the second. We conduct experiments using benchmark instances found in the literature to assess the performance of the proposed method. The experimental results show that the proposed method is effective and efficient for multiobjective scheduling problems.
学科与关键词
关键词
SchedulingJob shopMultiobjectiveGenetic algorithmShifting bottleneck heuristicDispatching rules
- Evolutionary algorithms for multi-objective flexible job shop cell schedulingDeliktas, Derya*; Ozcan, Ender; Ustun, Ozden; Torkul, OrhanAPPLIED SOFT COMPUTING, 2021, 113: 107890.被引 21
- Research on Multi-Objective Scheduling Algorithm of Job Shop Considering Limited Storage and Transportation CapacityPeng, Chengfeng; Li, Zhantao; Zhong, Hongyang; Li, Xiang; Lin, Anping; Liao, Yong*IEEE Access, 2023, 11: 94252-94280.被引 1
- A Hybrid Multiobjective Evolutionary Approach for Flexible Job-Shop Scheduling ProblemsXiong, Jian*; Tan, Xu; Yang, Ke-wei; Xing, Li-ning; Chen, Ying-wuMATHEMATICAL PROBLEMS IN ENGINEERING, 2012, 2012: 478981.被引 16
