Taboo Search And Its Application 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.Taboo search is presented by Glover in 1986.It's an expandance of local neighborhood search algorithm, and it's a simulation of human's intelligence. Taboo search uses a flexible storage structure and corresponding taboo principle ,and absolves some better solution by using aspiration criterion to avoid trapping into local minimum value. Many directions in searching promise Taboo search to get the best value globally. Taboo search has got the big success in the field of combination optimization, product scheduling, circuit design and neural network. So far Taboo search has been used widely and successfully in the field of job scheduling.In this dissertation we study the scheduling theory and its development systemically, and present a solution scheme to solve the job scheduling control problem in the workshop, then we design and implement an intelligent job scheduling platform for workshop. Based on studying many intelligent search algorithm we research the Taboo search algorithmemphatically, and modify the algorithm to improve its performance in job shop scheduling problem.