Application Of Hybrid Optimization Strategy In Job-shop Schedule

Scheduling is assigning resource and time to the job given the constraint condition by sorting them. A scheduling problem is to find a series of operation of a job on given machines in order to make some object functions get the best value. A scheduling problem is a combination optimism problem.The enterprise information systems using in a certain workshop have met lots of difficulties. Both developers and users need a generally designed, widely fitted and highly intelligent support platform for resource optimization . How to resolve the dynamic scheduling problem in order to make an efficient product plan quickly is the primary problem in the scheduling research field. Import of the optimization theory in the field of job scheduling in workshop, improving the performance of algorithm, and making the algorithm work perfectly are important tasks.In this dissertation, I mainly carry out those works:1. In this dissertation I study the scheduling theory and its development systemically, and present its localization.2. In this dissertation I study the scheduling theory and its development systemically, and present a solution scheme to solve the job scheduling control problem in the workshop, then I design and implement a job scheduling platform for workshop.3. Based on studying many intelligent search algorithm I research the Genetic algorithm emphatically, presented two hybrid strategies: one is a hybrid algorithm of genetic algorithm and tabu search, the other is a hybrid gentic algorithm based on neighborhood search.4. The two hybrid strategies are tested by real data.