Please use this identifier to cite or link to this item:
|Title: ||Application of signed distances method to integrated linear programming for fuzzy multi-objective project management|
|Authors: ||Ming-Jaan Wang;Ming-Feng Yang|
|Contributors: ||NTOU:Department of Transportation Science|
|Keywords: ||Project management;Fuzzy set;Fuzzy multi-objective linear programming|
|Issue Date: ||2011-10-20T08:37:26Z
|Publisher: ||International Journal of Innovative Computing Information and Control|
|Abstract: ||Abstract:The belief that the project manager, a person in charge of the project man-agement (PM), plays a very important role to handle conicting goals with the usage of all resources through the organization is without doubt. The main purpose of the project management is to minimize total project and crashing cost with the reference to both di-rect and indirect cost and other related constraints simultaneously. This work focuses on the application of fuzzy sets to solve fuzzy multi-objective PM decision problem with the consideration of its completion time in a suitable range; and it will present an interactive solution procedure to determine the preferred compromise solution for the multi-objective PM decision problem. The proposed approach considers the imprecise nature of the input data by implementing the minimum operator and also assumes that each objective func-tion has a fuzzy goal. And this approach focuses on minimizing the worst upper bound to obtain an efficient solution which is close to the best lower bound of each objective function. For attaining our objective, a detailed numerical example is presented to illus-trate the feasibility of applying the proposed approach to actual PM decision problem at the end of this paper. Furthermore, we believe that this approach can be applied to solve other multi-objective decision making problems.|
|Relation: ||7(1), pp.237-252|
|Appears in Collections:||[運輸科學系] 期刊論文|
Files in This Item:
There are no files associated with this item.
All items in NTOUR are protected by copyright, with all rights reserved.