Browsing by Author "Sivarajah, S."

Now showing 1 - 1 of 1
  • No Thumbnail Available
    Item
    Jobshop Scheduling Problem for Parallel Machine Using Genetic Algorithm
    (Uva Wellassa University of Sri Lanka, 2013) Sivarajah, S.
    The Job-Shop Scheduling Problem (JSSP) is a non-polynomial hard problem. The main objective of the JSSP is to find a schedule for jobs, to optimize a given performance measure. In this research we used maximum completion time, which is the maximum time needed to process all n number of jobs on m number of machines. They cannot be formulated as a linear programming problem and no simple rules or algorithms yield to optimal solutions in a short time. In this paper we used a modified Genetic Algorithm (GA) approach to solve the problem of job shop scheduling.