Sivarajah, S.2021-11-032021-11-032013UWU/SCT/09/0035http://www.erepo.lib.uwu.ac.lk/bitstream/handle/123456789/7553/SCT%2009%20035-27102021144836.pdf?sequence=1&isAllowed=yThe 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.enScience and Technology Degree Programme (SCT)Thesis