In this paper, we consider the problem of stochastic project network when some or all activities are interrupted. An approach has been built to schedule the critical activities, by constructing some expressions based on the project lateness costs due to the interruption activities. Two simple example are presented to validate our approach.

Key words: Project Management, Project scheduling, Stochastic activity duration, Stochastic PERT.    

Introduction

   Recently, Projects planning and optimal timing, under uncertainty are extremely critical for many organizations, see [19]. Having an effective mathematical model wi

The aim of the research is to use this technique and to determine the effect of this method in reduce cost per unit of the company. The traditional method used in the company the research sample to determine the indirect costs, the definition of the concepts and characteristics of the method of cost-based activity and the cost method based on time-driven activity and justifications applied to companies.   In order to achieve the research objectives, the main hypotheses were formulated. That was represented: (The applied of (TDABC) Time driven activity based costing method in reducing indirect costs, leads reduce cost per unit than the use of the traditional method of allocating indirect costs in the research sample company).&nb

The convergence speed is the most important feature of Back-Propagation (BP) algorithm. A lot of improvements were proposed to this algorithm since its presentation, in order to speed up the convergence phase. In this paper, a new modified BP algorithm called Speeding up Back-Propagation Learning (SUBPL) algorithm is proposed and compared to the standard BP. Different data sets were implemented and experimented to verify the improvement in SUBPL.

Beta Distribution

Abstract

             Gamma and Beta Distributions has very important in practice in various areas of statistical and applications reliability and quality control of production. and There are a number of methods to generate data behave on according to these distribution. and These methods bassic primarily on the shape parameters of each distribution and the relationship between these distributions and their relationship with some other probability distributions.    &nb

 Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved.  In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO)

The basic solution to overcome difficult issues related to huge size of digital images is to recruited image compression techniques to reduce images size for efficient storage and fast transmission. In this paper, a new scheme of pixel base technique is proposed for grayscale image compression that implicitly utilize hybrid techniques of spatial modelling base technique of minimum residual along with transformed technique of Discrete Wavelet Transform (DWT) that also impels mixed between lossless and lossy techniques to ensure highly performance in terms of compression ratio and quality. The proposed technique has been applied on a set of standard test images and the results obtained are significantly encourage compared with Joint P

Coronary artery disease (CAD) is the leading cause of death worldwide. Certain genetic polymorphisms play an important role in this multifactorial disease, being linked with increased risk of early onset CAD.