MINIMIZING MAKESPAN FOR AN AEROSPACE MANUFACTURING SYSTEM USING SIMPLE GENETIC OPERATIONS

Alvin Mark Windsor, V.Vivekanand, G.S.Prakash, Sriram Anupindi

Abstract: In a job shop scheduling problem as the number of jobs and machines becomes larger, identifying the optimum schedule to achieve a particular objective becomes complex. Recent development in this field has led to approximating algorithms designed to handle a large solution space. Some of which include Genetic Algorithm, Tabu Search, Simulated Annealing and Particle Swarm Optimization. These algorithms can be used to obtain a near optimal schedule with improved solution efficiency. This paper discusses the development of a deterministic model to schedule 12 jobs on 5 machines with the objective of minimizing makespan using simple genetic operators.

Keywords: Job Shop, Genetic Algorithm, Makespan, Scheduling, Sequencing.

DOI: https://doi.org/10.15623/ijret.2016.0528014