Development of New Paradigms for Job Shop Scheduling Problems
M. Hymavathi, C.S.P Rao · 2014
In this paper, various new meta-heuristic solution approaches for both mono and multi objective Job Shop Scheduling Problems are presented. Various methods have been used in the field of Job Shop Scheduling. The methods used for JSSP are generally divided into two broad categories: traditional approaches and non traditional approaches. More focus on the application of Non Traditional methods for JSSP is increasing compared to traditional techniques. For the same cost and time non traditional methods yeild better solutions compared to traditional methods. There are fewer applications of Particle Swarm Optimization (PSO) and Hybrid Particle Swarm Optimization (HPSO) for JSSPs.There are fewer applications of Artificial Immune Algorithms (AIA) for JSSPs. The power of AIA is not fully exploited for JSSPs. Bacterial Foraging Optimization (BFO) algorithm have very few instances of apllications to JSSPs. Invasive Weed Optimization (IWO), Music Based Harmony Search (MBHS) were used to address several other engineeing optimization problem and they were not used for JSSPs.