| dc.description.abstract | This study explores the production scheduling problems of Floor Shop, Unrelated Parallel Machine, Machine Eligibility, Sequence Dependent Setup Time and Sequence Independent Setup Time and also attempts to solve the following research question: the minimization of ΣCj & ΣTj.
This study also analyzes the combinations of run card in the case-study factory through the following procedures. First, confine the problems of the whole workstations scheduling to the three working stations with anterior section of having setup time process by means of TOC. Next, implement the independent analysis of the process feature in these three stations, and then further restrict the problems to a certain Solder musk working station, featuring Unrelated Parallel Machine, Machine Eligibility, Balance of Capacity and Setup Time Issue, which is the bottleneck station in the production line. Then, with the concept of D-B-R, simplify the problems of production scheduling in the whole line by assimilating the scheduling in Solder musk station into goods issue scheduling. Finally, use the Meta-heuristics built in the Excel as the means of instruments.
This study begins with a mathematical module to evaluate the performance of effects in the case-study factory and uses the authentic data of run card as the test foundation. Then, activate the comparison of performance of effects by means of three Dispatching Rules – SPT, EDD, and LST, artificial scheduling, as well as the Meta-heuristics built in the Excel. The result demonstrates 10 to 43 percent of improvement in the item of cost of setup calculated by the Meta-heuristics built in the Excel. However, there is no significant improvement in the item of ΣTj. | en_US |