Identical Parallel Machine E/T Scheduling Problem With Mould

Since 1980, the first overview about machine scheduling problem is published by Graham and Graves, many scholars in the world have been attracted to the research on theory and application of machine scheduling. Now a great progress has been made. Machine scheduling problem not only has abundant research content, but also is a research field with abroad application foreground in many practical systems, such as manufacture, logic, computer configuration, transportation, aero and space flight, and so on. This makes the research of machine scheduling more attractive and challenging. Identical parallel-machine E/T scheduling problem with mould constraint based on common due-date is studied. The object is to minimize the sum cost of Earliness, Tardiness, due-date and moulds. Another research of arranging the jobs again for the scheduling system which has a disturbance of the number of the machine and mould. Firstly, the theory of the single machine E/T scheduling problem is introduced. Base on this, the heuristic algorithm of calculating the due-date and arranging the jobs is designed. The methods used in this dissertation include Genetic Algorithm, Heuristic algorithm and Simulated Annealing. particular encoding, crossover and mutation are designed, and a concept of chromosome repair is developed for finding feasible solutions. The effectiveness of the mixed GA is illustrated by the simulation of three different scheduling system.