Pantila Watanakich. Scheduling for a two-stage hybrid flow shop with machine setup time. Master's Degree(Industrial Engineering). Kasetsart University. Office of the University Library. : Kasetsart University, 2001.
Scheduling for a two-stage hybrid flow shop with machine setup time
Abstract:
This thesis considers the scheduling for a two-stage hybrid flow shop with machine setup time. Each stage consists of multiple parallel machines. Each batch size of job has to be processed sequentially through both production stages on any of the available machines. There are several independent jobs to be scheduled without preemption. The objective is to minimize the maximum completion time of the job in order to minimize the throughput time. The problem is formulated as a mixed integer programming. Given this problem is NP-hard, a heuristic method was developed to identify the feasible solution using three lower bounds to compare the near optimal solution.The heuristics can be divided into two phases. Firstly, the jobs will be given priority in scheduling on machines in both stages based on thirteen dispatching rules, called job-sequencing phase. Then, the jobs will be assigned to the available machine in each production stage by following a heuristic method called job-allocation phase. The heuristic also allows setup time of each job on machine in second stage to be processed in advance while waiting for that job to finish its processing from the previous stage.The results from the heuristic method were compared with the best values among the three lower bounds by testing with 3,120 generated problems. It was found that on the average LPT2 or longest processing time scheduling rule yielded the best results. This rule provided the average of % error lower bound less than 0.05% comparing with the other rules. In the meantime, when the number of machine in stage 1 was larger than that of stage 2, SPT1 gave the best result when the difference between setup and processing time was greater than 5 times. Otherwise, LPT2 and LPT12 gave bette solutions.
Kasetsart University. Office of the University Library