TY - JFULL AU - Tarek Aboueldah and Hanan Farag PY - 2021/9/ TI - Discrete Breeding Swarm for Cost Minimization of Parallel Job Shop Scheduling Problem T2 - International Journal of Mathematical and Computational Sciences SP - 97 EP - 102 VL - 15 SN - 1307-6892 UR - https://publications.waset.org/pdf/10012188 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 176, 2021 N2 - Parallel Job Shop Scheduling Problem (JSSP) is a multi-objective and multi constrains NP-optimization problem. Traditional Artificial Intelligence techniques have been widely used; however, they could be trapped into the local minimum without reaching the optimum solution. Thus, we propose a hybrid Artificial Intelligence (AI) model with Discrete Breeding Swarm (DBS) added to traditional AI to avoid this trapping. This model is applied in the cost minimization of the Car Sequencing and Operator Allocation (CSOA) problem. The practical experiment shows that our model outperforms other techniques in cost minimization. ER -