Minimizing the Make Span and Tardiness of Identical Parallel Machines by Genetic Algorithm

Recent customer demand for high-variety products has contributed to an increase in product complexity that emphasizes the need for improved scheduling. The scheduling leads to increase in capacity utilization efficiency and hence thereby reducing the time required to complete jobs and consequently increasing the profitability of an organization in present competitive environment. Job shop scheduling is generally considered to be the one of the most significant issues in the planning and operation of a manufacturing system. Job shop scheduling (JSS) with make span criteria is non-polynomial hard. A genetic algorithm has been proposed which generates improved make span time and reduce tardiness, earliness costs for m number of identical machines with n given number of jobs in Sartaj Industry, Chandigarh. A Java-based program has been developed. The proposed algorithm is found to generate improved results, viz, cost saving for an annum and the total cost reduction.