|
| References | Types of problems | Objectives | Approaches |
|
| Pan et al. [1] | Lot-streaming FSP | Minimize the total weighted earliness and tardiness penalties | Discrete artificial bee colony |
| Riahi and Kazemi [6] | No-wait FSP | Minimize the makespan | A hybrid ant colony optimization and simulated annealing algorithm |
| Marichelvam et al. [7] | FSP | Minimize the makespan and total flow time | A hybrid monkey search algorithm based on subpopulation |
| Ruize and Stützle [31] | Permutation FSP | Minimize the makespan | Iterated greedy algorithm |
| Xu et al. [32] | Permutation FSP | Minimize the makespan and total weighted tardiness | Iterated local search |
| Lei and Zheng [11] | HFSP | Minimize the total tardiness, maximum tardiness, and makespan | A novel neighborhood search with global exchange |
| Zhang et al. [12] | HFSP | Minimize the total flow time | Effective modified migrating birds optimization |
| Yu et al. [13] | HFSP | Minimize the total tardiness | Genetic algorithm |
| Pan et al. [14] | HFSP | Minimize the makespan | Nine effective metaheuristics |
| Tasgetiren et al. [33] | Blocking FSP | Minimize the makespan | Iterated greedy algorithm |
| Yagmahan and Yenisey [34] | FSP | Minimize the makespan and total flow time | Ant colony system algorithm |
| Zhang and Xing [29] | FSP | Minimize the makespan | Differential evolution |
| Zhou et al. [30] | HFSP | Minimize the total weighted completion time | A hybrid differential evolution with an estimation of distribution algorithm |
| This study | HFSP | Minimize the makespan and cost of delay | A hybrid differential evolution and local search |
|
