Author:
Kamal Amjad Muhammad,Ikramullah Butt Shahid,Anjum Naveed
Abstract
This paper presents optimization of makespan for Flexible Job Shop Scheduling Problems (FJSSP) using an Improved Genetic Algorithm integrated with Rules (IGAR). Machine assignment is done by Genetic Algorithm (GA) and operation selection is done using priority rules. Improvements in GA include a new technique of adaptive probabilities and a new forced mutation technique that positively ensures the generation of new chromosome. The scheduling part also proposed an improved scheduling rule in addition to four standard rules. The algorithm is tested against two well-known benchmark data set and results are compared with various algorithms. Comparison shows that IGAR finds known global optima in most of the cases and produces improved results as compared to other algorithms.
Reference16 articles.
1. Chaudhry I.A. and Khan A.A., International Transactions in Operational Research, A research survey: review of flexible job shop scheduling techniques. 41, (2015).
2. Chen M. and Li J.-L.. Genetic Algorithm Combined with Gradient Information for Flexible Job-shop Scheduling Problem with Different Varieties and Small Batches. in MATEC Web of Conferences. 2017. EDP Sciences.
3. Amjad M.K., Butt S.I., Kousar R., Ahmad R., Agha M.H., Faping Z., Anjum N., and Asgher U., Mathematical Problems in Engineering, Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems. 2018, 32, (2018).
4. Qiao, Qiaoyun W.L., Solving the Flexible Job Shop Scheduling Problems Based on the Adaptive Genetic Algorithm, in International Forum on Computer Science-Technology and Applications IFCSTA ‘09), Qihai Z., Editor. 2009. p. 97-100.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献