Masoud Abdolzadeh

Learn More
The Job shop scheduling problem (JSSP) is one of the NP-Hard combinatorial optimization problems. During the last four decades, many researches were devoted on this problem. The goal in the problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolve Cellular Learning Automata (CLA) to make it able to(More)
  • 1