Author:
Tansui Daranat,Thammano Arit
Publisher
Springer International Publishing
Reference12 articles.
1. Kaur, A., Khehra, B., Virk, I.: Makespan optimization in job shop scheduling problem using differential genetic algorithm. Int. J. Comput. Appl. 172(10), 30–36 (2017)
2. Piroozfard, H., Wong K., Hassan, A.: A hybrid genetic algorithm with a knowledge-based operator for solving the job shop scheduling problems. J. Optim. 1–13 (2016). Author, F., Author, S., Author, T.: Book title. 2nd edn. Publisher, Location (1999)
3. Hasan, S., Sarker, R., Essam, D., Cornforth, D.: Memetic algorithms for solving job-shop scheduling problems. Memetic Comput. 1(1), 69–83 (2008).LNCS Homepage. http://www.springer.com/lncs. Accessed 21 Nov 2016
4. Bhatt, N., Chauhan, N.: Genetic algorithm applications on job shop scheduling problem: a review. In: International Conference on Soft Computing Techniques and Implementation, pp. 7–14. ICSCTI, Faridabad, India doi: https://doi.org/10.1109/ICSCTI.2015.7489556
5. Peng, C., Wu, G., Liao T., Wang, H.: Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem. PLOS ONE 14(9), e0223182 (2019). https://doi.org/10.1371/journal.pone.0223182