Application Of Differential Evolution For Solving Job Shop Scheduling Problem

Pajaree Punnawat, Komkrit Leksakul


Job Shop Scheduling problem (JSSP) is a famous problem in which jobs are assigned to machines at particular times, while trying to minimize the total length of the schedule (Makespan). This characteristic of the problem make it be NP-Hard problem that cannot be solved by using the exact algorithms in polynomial time. So this study used the Differential Evolution (DE) algorithm, one of the approximate algorithms, to solve Job Shop Scheduling problem. Based on our experiment, we could indicate that the results of small and medium size problems using DE approach obtained the optimal solution reliably and effectively.

Full Text:



Banharnsakun, A., Sirinaovakul, B., & Achalakul, T. (2012). “Job Shop Scheduling with the Best-so-far ABC”. Engineering Applications of Artificial Intelligence, 25(3), 583-593. doi:

Gonçalves, J. F., de Magalhães Mendes, J. J., & Resende, M. c. G. C. (2005). “A hybrid genetic algorithm for the job shop scheduling problem”. European Journal of Operational Research, 167(1), 77-95. doi:

Gromicho, J. A. S., van Hoorn, J. J., Saldanha-da-Gama, F., & Timmer, G. T. (2012). “Solving the job-shop scheduling problem optimally by dynamic programming”. Computers & Operations Research, 39(12), 2968-2977. doi:

Qing, R., & Wang, Y. (2012). “A new hybrid genetic algorithm for job shop scheduling problem”. Computers & Operations Research, 39(10), 2291-2299. doi:

Wisittipanich, W., & Kachitvichyanukul, V. (2011). “Two enhanced differential evolution algorithms for job shop scheduling problems”. International Journal of Production Research, 50(10), 2757-2773. doi:


  • There are currently no refbacks.