No abstract

In this paper we propose a new searching method of Genetic Algorithm for Job-shop scheduling problem (JSP). The coding method that represent job number in order to decide a priority to arrange a job to Gannt Chart (called the ordinal representation with a priority) in JSP, an active schedule is created by using left shift. We define an active solution at first. It is solution which can create an active schedule without using left shift, and set of its defined an active solution space. Next, we propose an algorithm named Genetic Algorithm with active solution space search (GA-asol) which can create an active solution while solution is evaluated, in order to search the active solution space effectively. We applied it for some benchmark problems to compare with other method. The experimental results show good performance.

SUMMARYIn this paper we propose a new searching method of Genetic Algorithm for the job-shop scheduling problem (JSP). The coding method represents job number in order to decide a priority to arrange a job in the Gantt chart (called the ordinal representation with a priority) in JSP, and an active schedule is created by using left shift. We define an active solution at first. It is a solution that allows the creation of an active schedule without using left shift, and the setting of a defined active solution space. Next, we propose an algorithm, Genetic Algorithm with active solution space search (GA-asol), which can create an active solution while solution is evaluated, in order to search the active solution space effectively. We applied it to some benchmark problems for comparison with other methods. The experimental results show good performance.