Family-based dispatching is a way to improve lead time performance at any work place. Exhaustive rules of family-based dispatching can avoid the setup time in order to promote the flowtime and tardiness performance. Although non-exhaustive rules add t...
Family-based dispatching is a way to improve lead time performance at any work place. Exhaustive rules of family-based dispatching can avoid the setup time in order to promote the flowtime and tardiness performance. Although non-exhaustive rules add the number of setup, it can provide a flexibility and competitiveness when setup time is small. In this paper, we studied the preemption based on the family-based dispatching, which includes three purposes. The first one is to analyze the results after increasing the number of non-exhaustive rules and job-preemption. The second one is to get the optimal group by combining FBD rules with non-preemption, family-preemption and job-preemption one by one. The final one is to make clear of the factors affecting preemption and FBD.
We adopted the Arena software package to simulate the environments of one machine and two machines, respectively. We found that one specific group can’t achieve the best performance for all cases. Conversely, it will change with the utilization ratio, set-up to runtime ratio and priority location.