Dynamic flexible job shop scheduling (JSS) is an important combinatorial optimization problem with complex routing and sequencing decisions under dynamic environments. Genetic programming (GP), as a hyperheuristic approach, has been successfully applied to evolve heuristics for JSS. However, its training process time consuming, it faces the retraining once characteristics of scenarios vary. It ...

The flexible job shop scheduling problem (FJSP) is an extension of the classical and one more well-known NP-hard problems. To get better global optima FJSP, a novel hybrid whale optimization algorithm (HWOA) proposed for solving in which minimizing makespan considered as objective. Firstly, uniformity extensiveness initial population distribution are increased with good point set (GPS). Secondl...

Job shop scheduling is one of the most explored areas in the last few decades. Although it is very commonly witnessed in real-life situations, very less investigation has been carried out in scheduling operations of multi-level jobs, which undergo serial, parallel, and assembly operations in an assembly job shop. In this work, some of the dispatch rules, which have best performances in scheduli...