This study presents the multi criteria single-machine model. The machine scheduling problem (MSP) for ntasks on a single machine involves minimizing a function of three criteria: total completion time (C_j),maximum earliest (E_max), and tardiness (〖ΣT〗_j), This is an NP-hard issue. Within this work's theoretical section, we present the mathematical formulation of The presented topic thenhighlights the usefulness of the dominance rule (DR), which may be used to develop effective solutions. Whilein the practical part, one of the important exact methods; The proposed MSP tricriteria are solved by applyingthe Branch and Bound (BAB) method, which finds a set of efficient solutions for 1//F(ΣC_j ,ΣT_j ,E_max) upto n=100 jobs. The BAB approach finds the efficient solutions for the issue in an acceptable amount of time. Inaddition, we provide two heuristic approaches to address the problem in order to obtain appropriateapproximations. The two proposed approaches' good performance is demonstrated by the practicalexperiments.
<span>One of the main difficulties facing the certified documents documentary archiving system is checking the stamps system, but, that stamps may be contains complex background and surrounded by unwanted data. Therefore, the main objective of this paper is to isolate background and to remove noise that may be surrounded stamp. Our proposed method comprises of four phases, firstly, we apply k-means algorithm for clustering stamp image into a number of clusters and merged them using ISODATA algorithm. Secondly, we compute mean and standard deviation for each remaining cluster to isolate background cluster from stamp cluster. Thirdly, a region growing algorithm is applied to segment the image and then choosing the connected regi
... Show MoreHospitals are part of the service organizations and most importantly at the level of individuals because they are tied to the people health and their daily lives , the nursing service is one of the important services provided by hospitals, and nurses are the human resource that offers this service, from this standpoint the idea of research came to prepare work Scheduling for nurses in a scientific way to improve performance operational for their services and provide efficient service available 24 hours a day, the research use one of the modern and scientific rules of scheduling its “schedule of
... Show MoreIn this paper, the effect size measures was discussed, which are useful in many estimation processes for direct effect and its relation with indirect and total effects. In addition, an algorithm to calculate the suggested measure of effect size was suggested that represent the ratio of direct effect to the effect of the estimated parameter using the Regression equation of the dependent variable on the mediator variable without using the independent variable in the model. Where this an algorithm clear the possibility to use this regression equation in Mediation Analysis, where usually used the Mediator and independent variable together when the dependent variable regresses on them. Also this an algorithm to show how effect of the
... Show MoreThe aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).
The aim of this paper, is to study different iteration algorithms types two steps called, modified SP, Ishikawa, Picard-S iteration and M-iteration, which is faster than of others by using like contraction mappings. On the other hand, the M-iteration is better than of modified SP, Ishikawa and Picard-S iterations. Also, we support our analytic proof with a numerical example.
Abstract :
This present paper sheds the light on dimensions of scheduling the service that includes( the easiness of performing the service, willingness , health factors, psychological sides, family matters ,diminishing the time of waiting that improve performance of nursing process including ( the willingness of performance, the ability to perform the performance , opportunity of performance) . There is genuine problem in the Iraqi hospitals lying into the weakness of nursing staffs , no central decision to define and organize schedules. Thus the researcher has chosen this problem as to be his title . The research come a to develop the nursing service
... Show MoreThe advancements in horizontal drilling combined with hydraulic fracturing have been historically proven as the most viable technologies in the exploitation of unconventional resources (e.g., shale and tight gas reservoirs). However, the number of fractures, well timing, and arrangement pattern can have a significant impact on the project economy. Therefore, such design and operating parameters need to be efficiently optimized for obtaining the best production performance from unconventional gas reservoirs. In this study, the process of selecting the optimal number of fractures was conducted on a section of a tight gas reservoir model (based on data from the Whicher Range (WR) tight gas field in Western Australia). Then, the optimal number
... Show MoreNowadays, cloud computing has attracted the attention of large companies due to its high potential, flexibility, and profitability in providing multi-sources of hardware and software to serve the connected users. Given the scale of modern data centers and the dynamic nature of their resource provisioning, we need effective scheduling techniques to manage these resources while satisfying both the cloud providers and cloud users goals. Task scheduling in cloud computing is considered as NP-hard problem which cannot be easily solved by classical optimization methods. Thus, both heuristic and meta-heuristic techniques have been utilized to provide optimal or near-optimal solutions within an acceptable time frame for such problems. In th
... Show More