| Summary: | 碩士 === 輔仁大學 === 管理學研究所 === 94 === Production scheduling is concerned with the problem of scheduling available machines to process jobs effectively. Due to the popularity of the just-in-time philosophy, in-time delivery of jobs has become one of the crucial factors for customer satisfaction. Scheduling plays an important role in achieving this goal. About the just-in-time issue, most of the prior researches were to deal with the problem of minimizing total earliness-tardiness penalty. In this paper, we study the scheduling problem of minimizing the number of early and tardy jobs (or maximizing the number of in-time jobs). Specifically, we consider the problem with a set of independent jobs to be processed on several identical parallel machines. All jobs have a common due window. We first develop some theorems about this performance measure. Then we propose an efficient solution algorithm for the problem according to those theorems. Finally, we use the simulated data to test the effectiveness and efficiency of the algorithm. Our computational experiments show that the algorithm we propose can get optimal solution in very short time. Further, we find that CPU time is independent of , , and m. It is dependent of n. On the other hand, maximizing the number of in-time jobs are independent of and . It is dependent of , m and n.
|
|---|
