Job-shop scheduling : Tabu list analysis
A tabu search based heuristic scheduling algorithm was investigated to determine which of four factors or their interactions affect tabu list utilization as the algorithm moves away from a local optimum. The four factors were machine routings, the machine processing time for each operation and the ready-time for each job, the initial starting schedule, and problem size. It was found that the algorithm would visit the largest number of schedules before cycling or terminating a search if 90% of the time the tabu list was accessed within "t" moves of a local optimum ("t" is the length of the tabu list). This result is independent of problem size. It was also determined that the way the operations are assigned to the machines affects the tabu list utilization and implies that certain machines are critical when determining good schedules. This result can be used for further study to improve the search procedure.
This item is only available in print in the UCF Libraries. If this is your thesis or dissertation, you can help us make it available online for use by researchers around the world by downloading and filling out the Internet Distribution Consent Agreement. You may also contact the project coordinator Kerri Bottorff for more information.
Master of Science (M.S.)
College of Engineering
Industrial Engineering and Management Systems
Length of Campus-only Access
Masters Thesis (Open Access)
Dissertations, Academic -- Engineering; Engineering -- Dissertations, Academic
Haight, LeVoy Golden, "Job-shop scheduling : Tabu list analysis" (1991). Retrospective Theses and Dissertations. 3844.