| Summary: | 碩士 === 國立交通大學 === 資訊管理研究所 === 102 === The relocation problems have received considerable research attention in recent years. This study considers the relocation problem with release dates constraints. A feasible schedule must satisfy the resource constraints and release date constraints simultaneously. The introduction of release dates makes the problem NP-hard in its general form. In this thesis, we present an integer programming model to formulate the problem and propose several solution methods. We indicate whether some different special cases of the problem can be solved in polynomial time or not. If it can, efficient solution algorithms are proposed. On the other hand, if it cannot, proofs are provided to show the NP-hardness. Moreover, tabu search is adopted for handing this hard problem. In order to improve the performance of tabu search, heuristics algorithms are designed to produce initial solutions. We conduct a series of computational experiments to evaluate the effectiveness and efficiency of all of the proposed algorithms.
|
|---|
