| Summary: | 碩士 === 逢甲大學 === 統計與精算所 === 97 === This paper investigates a situation in manufacture environment where the job time isn’t a fixed value. That is, the job time becomes long as the waiting time passes, and the scheduling without buffer equipment cause blocking phenomenon. Making the manufacturing time will need more time to complete. Therefore, the job time is assumed as an increasing function of its starting time in this paper. In the manufacture environment, we will schedule these jobs on two-machine flowshop to make the finish time of the last job as shorter as possible, and get to the most availability produce.
This paper will take the finished time of the last job as the goal function, and we will develop some dominance properties and lower bounds. Moreover, we also develop a branch-and-bound algorithm to find the optimal solution. Meanwhile, we will propose four heuristic algorithms for a near-optimal solution.
Finally, the computational results indicate the branch-and-bound algorithm can handle most instances up to jobs size 32 within a reasonable amount of time, and the weight-combination search algorithm of heuristic algorithms is only with the maximum of the average error percentage of less than 0.70％.
|
|---|
