| Summary: | 碩士 === 國立臺北科技大學 === 工業工程與管理研究所 === 97 === In real-life project management (PM) situations, the project managers must handle conflicting goals that govern the use of the resources within organizations. The proposed interactive possibilistic linear programming (IPLP) attempts to simultaneously minimize total project cost, total completion time and total crashing cost with reference to direct, indirect cost and relevant constraints. Besides, the proposed approach applies the signed distance method to transform fuzzy numbers into crisp values. Moreover, this paper will present an interactive solution procedure to determine the preferred compromise solution for the multi-objective PM decision problems. The proposed approach considers the imprecise nature of the input data by implementing the minimum operator and also assumes that each objective function has a fuzzy goal. It focuses on minimizing the worst upper bound to obtain an efficient solution which is close to the best lower bound of each objective function. In addition, this work also present a different opinion for project manager to make decisions if project completion time is in a suitable range in contrast to minimize the project completion time. When a project is extended beyond its normal completion time, the contractual penalty cost will be incurred, whereas, a project completed too fast before its completion time under normal conditions, much more crashing cost and float time will be incurred. At the end of the paper, two numerical examples are presented to illustrate the feasibility of applying the proposed approach to actual PM decision problems. Furthermore, this approach can be applied to solve other multi-objective decision making problems.
|
|---|
