Graduation date: 2000Unrelated parallel machines are machines that perform the same function but have\ud different capacity or capability. Thus, the processing time of each job would be different\ud on machines of different types. The scheduling environment considered is dynamic in\ud both job release time and machine availability. Additionally, each job considered can\ud have different weight, and due date. Split jobs are also considered in this research. The\ud number of jobs that needs to be processed in split-modes is pre-determined and not part\ud of the scheduling decision. Additional constraints are imposed on split jobs to ensure that\ud the absolute difference in completion time of the split portions of a job is within a user-specified margin. These constraints are supported by the Just-In-Time manufacturing\ud concept where inventory has to be maintained at a very low or zero level. The objective\ud of this research is to minimize the sum of the weighted tardiness of all jobs released\ud within the planning horizon.\ud The research problem is modeled as a mixed (binary) integer-linear programming\ud model and it belongs to the class of NP-hard problems. Thus, one cannot rely on using\ud an implicit enumeration technique, such as the one based on branch-and-bound, to solve\ud industry-size problems within a reasonable computation time. Therefore, a higher-level\ud search heuristic, based on a concept known as tabu search, is developed to solve the\ud problems. Four different methods based on simple and composite dispatching rules are\ud used to generate the initial solution that is used by tabu-search as a starting point. Six\ud different tabu-search based heuristics are developed by incorporating the different\ud features of tabu search. The heuristics are tested on eight small problems and the quality of their solutions is compared to their optimal solutions, which are obtained by applying\ud the branch-and-bound technique. The evaluation shows that the tabu-search based\ud heuristics are capable of obtaining solutions of good quality within a much shorter time.\ud The best performer among these heuristics recorded a percentage deviation of only\ud 1.18%.\ud The performance of the tabu-search based heuristics is compared by conducting a\ud statistical experiment that is based on a split-plot design. Three sizes of problem\ud structures, ranging from 9 jobs to 60 jobs and from 3 machines to 15 machines are used\ud in the experiment. The results of the experiment reveal that in comparison to other\ud initial-generation methods, the composite dispatching rule is capable of obtaining initial\ud solutions that significantly accelerate the tabu search based heuristic to get to the final\ud solution. The use of long-term memory function is proven to be advantageous in solving\ud all problem structures. The long-term memory based on maximum-frequency strategy is\ud recommended for solving the small problem structure, while the minimum-frequency\ud strategy is preferred for solving medium and large problem structures. With respect to\ud the use of tabu-list size as a parameter, the variable tabu-list size is preferred for solving\ud the smaller problem structure, but the fixed tabu-list size is preferred as the size of the\ud problems grows from small to medium and then large
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.