| Summary: | 博士 === 國立成功大學 === 工業管理學系 === 89 === Abstract
While MRP (Material Requirements Planning) system was proposed for more than thirty years, it is still a very useful management system in many industries. A huge MRP system with complicated materials structure, requires high performance computing facilities and hinders its popularity. As the cost effective parallel processing systems become commercial available, this study proposes infrastructure and algorithms for a MRP system to be implemented in the distributed computing environment.
Most of the previous research in this area has been focused on using a specific parallel machine in developing parallel programs. From a user point of view, this strategy has a high risk in the security and the maintainability of the system. Furthermore, there are many publications that are related to the design of parallel algorithms in various disciplines such as dynamic programming, matrix calculations, and lot sizing. However, to design a distributed MRP system, it is necessary to integrate many algorithms in the system in order to improve its overall efficiency. In summary, the main objects of this research include:
1. Based on the traditional MRP infrastructure and its key modules including product structural dissection, BOM explosion, and lot sizing calculation, a distributed MRP infrastructure is developed. The proposed system could be implemented on a portable distributed computing environment.
2. The dynamic lot-sizing model (DLS) is one of the most frequently used models in production and inventory system because lot decisions can greatly affect the performance of the system. This study developed a parallel algorithm to solve the lot-sizing problem efficiently. Given that n is the size of the problem, the complexity of the proposed parallel algorithm is O(n2p) with p processors. Numerical experiments are provided to verify the complexity of the proposed algorithm. The empirical results demonstrate that the speedup of this parallel algorithm approaches linearity, which means that the proposed algorithm can take full advantage of the distributed computing power as the size of the problem increases.
3. A next-level net requirements algorithm and accompanied MRP structure is also presented. The proposed method has proven to greatly reduce the computation complexity.
Findings on this study can certainly be extended to other management information systems in order to improve its computing cost efficiency. That is, there are strong needs to apply distributed computing to other management science disciples as the future study directions.
Keywords: MRP, Distributed Computing Environment, Complexity Analysis, Parallel Numerical Computation
|
|---|
