@article{(Open Science Index):https://publications.waset.org/pdf/10012188,
	  title     = {Discrete Breeding Swarm for Cost Minimization of Parallel Job Shop Scheduling Problem},
	  author    = {Tarek Aboueldah and  Hanan Farag},
	  country	= {},
	  institution	= {},
	  abstract     = {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.},
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {15},
	  number    = {8},
	  year      = {2021},
	  pages     = {98 - 102},
	  ee        = {https://publications.waset.org/pdf/10012188},
	  url   	= {https://publications.waset.org/vol/176},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 176, 2021},
	}