| Summary: | 碩士 === 逢甲大學 === 統計學系統計與精算碩士班 === 102 === The tardiness criterion is one of the most prominent measures in the scheduling area. To keep the tardiness in a lower level means to reduce the penalties incurred for late jobs. On the other hand, the precedence constraint exists in some real-life scheduling problems. For example, in the scheduling of patients from multiple waiting lines or different physicians, patients in the same waiting line for scarce resources such as organs, or with the same physician often need to be treated in the first-come-first serve sequence to avoid ethical or legal issues, and precedence constraints can restrict their treatment sequence. Motivated by these observations, we study a two-machine flowshop scheduling problem to minimize the total tardiness. To solve this problem, we use a genetic and a larger-order-value method for searching a near optimal solution and evaluate the yielded solution compared with an optimal solution obtained by full enumeration method. Finally, we conduct the experiments to test performances of all the proposed algorithms for the small and big numbers of jobs, respectively.
|
|---|
