| Summary: | 碩士 === 中原大學 === 工業工程研究所 === 82 === An ideal scheduling can both enhance the utility of machines
and increase the productivity. However, the traditional sche-
duling theories tend to get the best sequencing under the per-
fect manufacturing environment, and neglect the existing prob-
lems of the shop floor, and result in that the scheduling
theories cannot be applied in the shop floor. To recover the
gap between the scheduling thoeries and practical sequencing,
recent trends in scheduling research attempt to make it more
relevant and applicable. In this way, the scheduling environm-
ent in this based on the real shop floor situation. The paper
studies the problem of scheduling sequence , which means
loading dependent jobs on m pairs of indentical parallel
machines. Those jobs must be processed through two stages.
In the first stage, the setup time is sequence-dependent ; in
the second one,it is not. The objective is to minimize the
makespan. Meanwhile, take two cases when m=1 and m>1 into con-
sideration to enlarge the scope of our research. We divide
research scheme into two parts:one is allocation and the other
sequencing. In the first part,we will construct the cost
table, and then use Mathematical Programming to find an
allocation model. Next, use the model or loading model to get
an allocation. In the second part, use the approach of TSP to
find sequencing with the above allocation. At the same time ,
use the approach of BaB to find optimal sequencine. Finally,
compare the solution of linear programming with the optimal
solution to find out their relationship.
|
|---|
