| Summary: | 碩士 === 大同大學 === 資訊經營研究所 === 95 === Under the production environment of current manufacturing industry, how to reduce the total tardiness and complete a deal has become a major research topic and is critical to increase competency. Therefore, there are many schedules of dispatching rules under study proposing different solutions regarding to different situations. This study mainly discusses the schedule problem of Job Shop that takes into account due date and tolerant waiting time for scheduling process. In order to achieving the goal, we have proposed a heuristic algorithm of Backward Sequence Forward Schedule (BSFS) which uses the backward sequence to obtain the tolerant waiting time for every procedure and then proceeds the forward scheduling by making a judgment about Job and Operation to be done earlier, in order to reduce the total tradiness. In this thesis, we also hold a comparison discussion with Bake’s Modified Due Date (MDD) proposed in 1983.The result show to find out the performing characteristics regarding the total tardiness between both method. Because BSFS depend on Due Date for ready time, and in scheduling is according to operation time so it is a little effect scheduling result because of Due Date.
|
|---|
