| Summary: | 碩士 === 國立臺灣科技大學 === 工業管理系 === 97 === This thesis focuses on a parallel machine scheduling problem with family set-up times and an objective of minimizing total weighted flowtime. The family set-up time is incurred whenever there is a switch of processing from a job in one family to a job in another family. We develop a proposed heuristic which can select jobs into appropriate positions and balance the objectives for all machines. In other words, the proposed heuristic can select which families necessary to be split. There are two tests in our computational experiments: One is minimizing the total weighted completion time, and the other is minimizing the total completion time where all job weights are equal. Computational results show that the proposed heuristic performs well, especially in large problems, and that it outperforms an existing heuristic in terms of quality of solutions.
|
|---|
