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 …

The so-called “smartization” of manufacturing industries has been conceived as the fourth
industrial revolution or Industry 4.0, a paradigm shift propelled by the upsurge and …

Group scheduling problems have attracted much attention owing to their many practical
applications. This work proposes a new bi-objective serial-batch group scheduling problem …

Due to the development of modern information technology, the emergence of the fog
computing enhances equipment computational power and provides new solutions for …

The past decade has witnessed the adoption of artificial intelligence (AI) in various
applications. It is of no exception in the area of prognostics and health management (PHM) …

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 …

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 …

Rescheduling is a necessary procedure for a flexible job shop when newly arrived priority
jobs must be inserted into an existing schedule. Instability measures the amount of change …

The introduction of modern technologies in manufacturing is contributing to the emergence
of smart (and data-driven) manufacturing systems, known as Industry 4.0. The benefits of …