| Summary: | 碩士 === 國立臺北科技大學 === 工業工程與管理系碩士班 === 105 === In many times, the companies want to use machines with no-idle. But in practical, considering the cost or technology, and the companies can’t use machines with no-idle. For instance, productions of integrated circuit via photolithography, steel making and fiberglass processing. In recently years, flowshop scheduling has a change in the industry, from a single factory transformed into many factories. More and more companies use flowshop scheduling into their scheduling system. Therefore, this study emphasis on the factory to join the factors and mixed no-idle constraint. The optimization criterion is the minimization of the maximum completion time (Makespan). Therefore , we propose the CTBIG algorithm to solve this problem. The results show that the proposed CTBIG. algorithm is better than the IGPR algorithm.
|
|---|
