This paper provides an extensive review of the popular multi-objective optimization
algorithm NSGA-II for selected combinatorial optimization problems viz. assignment …

Job shop scheduling problem (JSSP) is a thriving area of scheduling research, which has
been concerned and studied widely by scholars in engineering and academic fields. This …

Due to its practicality, hybrid flowshop scheduling problem (HFSP) with productivity objective
has been extensively explored. However, studies on HFSP considering green objective in …

In modern manufacturing industry, dynamic scheduling methods are urgently needed with
the sharp increase of uncertainty and complexity in production process. To this end, this …

In modern volatile and complex manufacturing environment, dynamic events such as new
job insertions and machine breakdowns may randomly occur at any time and different …

The flexible job shop scheduling problem (FJSP) is an NP-hard combinatorial optimization
problem, which has wide applications in the real world. The complexity and relevance of the …

With the guidance of the advanced manufacturing philosophy, green scheduling and energy
efficiency have received considerable attention from enterprises and countries. Meanwhile …

The flexible job shop scheduling problem is a very important problem in factory scheduling.
Most of existing researches only consider the processing time of each operation, however …

Flexible job shop scheduling problem (FJSP) is an NP‐hard combinatorial optimisation
problem, which has significant applications in the real world. Due to its complexity and …

This paper presents a state-of-the-art review on multi-objective metaheuristics for multi-
objective discrete optimization problems (MODOPs). The relevant literature source and their …