Abstract— Operations research science (OR) deals with good success in developing and applying scientific methods for problem solving and decision-making. However, by using OR techniques, we can enhance the use of computer decision support systems to achieve optimal management for institutions. OR applies comprehensive analysis including all factors that affect on it and builds mathematical modeling to solve business or organizational problems. In addition, it improves decision-making and uses available resources efficiently. The adoption of OR by universities would definitely contributes to the development and enhancement of the performance of OR techniques. This paper provides an understanding of the structures, approaches and models of OR in problem solving and decision-making.

ملخص

ان إتخاذ القرارات المثلى في العمليات الادارية المختلفة هو اساس بناء وتطوير المؤسسات، ويقترح البحث تطبيق علم بحوث العمليات القائم على استخدام منهج التحليل الشامل الذي يرتكز على الأساليب العلمية لاعداد نموذج علمي وعملي لنظام حاسوبي يحقق الادارة المثلى للمؤسسة متضمنا جميع العوامل المؤثرة فيها، ويعمل على تنسيق الجهود لتحقيق الاهداف والغايات المطلوبة باستخدام الموارد المتاحة بكفاءة وفاعلية. ويهدف البحث الى تصميم وتطبيق نظام حاسوبي معلوماتي للمؤسسة الجامعية من خلال الوقوف على أهم العوامل المؤثرة في دورة حياة الأسرة الجامعية لمعالجة ضاهرة العنف الجامعي وتحقيق الاستخدام الأمثل لجميع مكونات وموارد الجامعه وطاقات افرادها ومتابعتها وادارتها بشكل ديناميكي يتناسب مع اي متغيرات مستجدة بشكل متكامل وسريع ودقيق وفعال.

ا    جامعة مؤتة – مؤتمر التخطيط الاستراتيجي في التعليم العالي “جدلية الإطار وفاعلية المضمون”  نيسان/2014

Abstract: In pattern matching or recognition the match usually has to be exact. This study, introduce a new general approach algorithm, called the Weighted Exact Matching Algorithm (WEMA). The WEMA applied to match the exact pattern within a text depending on preparing the text in an index matrix weight with the locations of characters in alphabetical order to perform direct access matching. Whereby, WEMA check the possibility of the pattern existence before applying the matching process. The simulation result showed significant improvement in the exact string matching and therefore extreme competence in the real applications.

How to cite this article:

Abdallah A. Hlayel and Adnan A. Hnaif, 2014. A New Exact Pattern Matching Algorithm (WEMA). Journal of Applied Sciences, 14: 193-196.

DOI: 10.3923/jas.2014.193.196

URL: http://scialert.net/abstract/?doi=jas.2014.193.196

Abstract: There is an increasing awareness among modern business, engineers, managers, and planners to design and operate their systems even to minimize cost, or to maximum profit (maximum efficiency/business benefits). Accordingly, significant work has been done on business (specially, on manufacturing system) operations for total demand and on the optimal allocation of resources available. Linear Assignment Problems (LAP) is one of the most important optimization problem solving methods (in Operation Research) support this problem. This paper proposes a new modifications on the Best Candidates Method (BCM) and compares the proposed method with other Linear Programming (LP) methods in solving Linear Assignment Problems (LAP). In general, there are many development approaches for LAP to reach the optimal solution through minimize or maximize the objective function. Each problem solving technique (method) has its own time complexity, and  solution optimality. Some methods can be used successfully when dealing with small scale problems, while they considered as an inefficient method when solving large scale problems. Performance of different LAP problem solving methods is presented because of their wide used in different area of optimization problems. We introduce our new modifications on BCM in solving LAP problems which has significant improvements in the number of combinations and searching strategy.

International Journal of Engineering Science and Technology (IJEST). ISSN : 0975-5462 Vol. 5 No.05. p1137.  May 2013, URL: http://www.ijest.info/docs/IJEST13-05-05-101.pdf.

ABSTRACT
Problem statement: The optimization processes in mathematics, computer science and economics are solving effectively by choosing the best element from set of available alternatives elements. The most important and successful applications in the optimaization refers to transportation problem (TP), that is a special class of the linear programming (LP) in the operation research (OR). Approach: The main objective of transportation problem solution methods is to minimize the cost or the time of transportation. Most of the currently used methods for solving transportation problems are trying to reach the optimal solution, whereby, most of these methods are considerd complex and very expansive in term of the execution time. In this study we use the best candidate method (BCM), in which the key idea is to minimize the combinations of the solution by choosing the best candidates to reach the optimal solution. Results: Comparatively, applying the BCM in the proposed method obtains the best initial feasible solution to a transportation problem and performs faster than the existing methods with a minimal computation time and less complexity. The proposed methods is therefore an attractive alternative to traditional problem solution methods. Conclusion/Recommendations: The BCM can be used successfully to solve different business problems of distrbution products that is commonly referd to a transportation problems.

How to cite this article:

Computer Science & Engineering: An International Journal (CSEIJ), Vol.2, No.5, October 2012

URL:  http://airccse.org/journal/cseij/papers/2512cseij03.pdf

Abstract: Problem statement: This study is about describing solution technique called Best Candidates Method (BCM) for solving optimization problems; the goal is to minimize the computation time to get the optimal solution. In this study I apply the BCM to the linear assignment problems (LAP) that is one of the optimization problems in the Operation Research (OR). Approach: The optimization problem solution methods operate in two ways. First, that find all available combinations in sequential or parallel solution manner then compare the results to get the optimal one, but its need a very large computation time either for a large scale problems. Second, is to try to reach directly the optimal solution using different methods, but all available methods not always reach the optimal solution and have a complex solution technique or have a long computation time. Results: The BCM elect the best candidates that give the lowest combinations to get the optimal solution. Conclusion/Recommendations: The BCM minimize the computation time and reduce the complexity where we can apply this method to different area of optimization problems.

How to cite this article:

Journal of Computer Science 8 (5): 711-715, 2012 ISSN 1549-3636 © 2012 Science Publications

URL:  http://www.thescipub.com/pdf/10.3844/jcssp.2012.711.715

Abstract: Approximate string matching algorithms are techniques used to find a pattern ‘P’ in a text ‘T’ partially or exactly. These techniques become very important in terms of performance and the accuracy of searching results. In this paper, we propose a general approach algorithm, called the Direct Matching Algorithm (DMA). The function of this algorithm is to perform direct access matching for the exact pattern or its similarities within a text depending on the location of a character in alphabetical order. We simulated the DMA in order to show its competence. The simulation result showed significant improvement in the exact string matching or similarity matching, and therefore extreme competence in the real applications.

How to cite this article:

Journal of Information Science 2014, Vol. 40(3) 357–362  The Author(s) 2014 Reprints and permissions: sagepub.co.uk/journalsPermissions.nav DOI: 10.1177/0165551513519039 jis.sagepub.com

URL:  http://jis.sagepub.com/content/40/3/357