The presented study investigated the scheduling regarding  jobs on a single machine. Each  job will be processed with no interruptions and becomes available for the processing at time 0. The aim is finding a processing order with regard to jobs, minimizing total completion time , total late work , and maximal tardiness  which is an NP-hard problem. In the theoretical part of the present work, the mathematical formula for the examined problem will be presented, and a sub-problem of the original problem of minimizing the multi-objective functions  is introduced. Also, then the importance regarding the dominance rule (DR) that could be applied to the problem to improve good solutions will be shown. While in the practical part, two

The improvement in Direction of Arrival (DOA) estimation when the received signals impinge on Active-Parasitic Antenna (APA) arrays will be studied in this work. An APA array consists of several active antennas; others are parasitic antennas. The responses to the received signals are measured at the loaded terminals of the active element. The terminals of the parasitic element are shorted. The effect of the received signals on the parasites, i.e., the induced short-circuit current, is mutually coupled to the active elements. Eigen decomposition of the covariance matrix of the measurements of the APA array generates a third subspace in addition to the traditional signal and noise subspaces generated by the all-active ante

     This paper deals with the numerical solution of the discrete classical optimal control problem (DCOCP) governing by linear hyperbolic boundary value problem (LHBVP). The method which is used here consists of: the GFEIM " the Galerkin finite element method in space variable with the implicit finite difference method in time variable" to find the solution of the discrete state equation (DSE) and the solution of its corresponding discrete adjoint equation, where a discrete classical control (DCC) is given.  The gradient projection method with either the Armijo method (GPARM) or with the optimal method (GPOSM) is used to solve the minimization problem which is obtained from the necessary conditi

     This article is devoted to presenting results on invariant approximations over a non-star-shsped weakly compact subset of a complete modular space by introduced a new notion called S-star-shaped with center f:  if   be a mapping and , . Then the existence of common invariant best approximation is proved for Banach operator pair of mappings by combined the hypotheses with Opial’s condition or demi-closeness condition

In this paper, the linear system of Fredholm integral equations is solving using Open Newton-Cotes formula, which we use five different types of Open Newton-Cotes formula to solve this system.  Compare the results of suggested method with the results of another method (closed Newton-Cotes formula)    Finally, at the end of each method, algorithms and programs developed and written in MATLAB (version 7.0) and we give some numerical examples, illustrate suggested method

The pre - equilibrium and equilibrium double differential cross
sections are calculated at different energies using Kalbach Systematic
approach in terms of Exciton model with Feshbach, Kerman and
Koonin (FKK) statistical theory. The angular distribution of nucleons
and light nuclei on 27Al target nuclei, at emission energy in the center
of mass system, are considered, using the Multistep Compound
(MSC) and Multistep Direct (MSD) reactions. The two-component
exciton model with different corrections have been implemented in
calculating the particle-hole state density towards calculating the
transition rates of the possible reactions and follow up the calculation
the differential cross-sections, that include MS

     In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr

This paper is concerned with finding the approximation solution (APPS) of a certain type of nonlinear hyperbolic boundary value problem (NOLHYBVP).  The given BVP is written in its discrete (DI) weak form (WEF), and is proved that  it has a unique APPS, which is obtained via the mixed Galerkin finite element method (GFE) with implicit method (MGFEIM) that reduces the problem to solve the Galerkin nonlinear algebraic system  (GNAS).  In this part, the predictor and the corrector technique (PT and CT) are proved convergent and are used to transform the obtained GNAS to  linear (GLAS ), then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are studied. The results

In this paper, we introduce a new complex integral transform namely ”Complex Sadik Transform”. The
properties of this transformation are investigated. This complex integral transformation is used to reduce
the core problem to a simple algebraic equation. The answer to this primary problem can than be obtained
by solving this algebraic equation and applying the inverse of complex Sadik transformation. Finally,
the complex Sadik integral transformation is applied and used to find the solution of linear higher order
ordinary differential equations. As well as, we present and discuss, some important real life problems
such as: pharmacokinetics problem ,nuclear physics problem and Beams Probem