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

In this article, it is interesting to estimate and derive the three parameters which contain two scales parameters and one shape parameter of a new mixture distribution for the singly type one censored data which is the branch of right censored sample. Then to define some special mathematical and statistical properties for this new mixture distribution which is considered one of the continuous distributions characterized by its flexibility. Next,  using maximum likelihood estimator method for singly type one censored data based on the Newton-Raphson matrix procedure to find and estimate values of these three parameter by utilizing the real data taken from the National Center for Research and Treatment of Hematology/University of Mus

This paper deals with the continuous classical optimal control problem for triple partial differential equations of parabolic type with initial and boundary conditions; the Galerkin method is used to prove the existence and uniqueness theorem of the state vector solution for given continuous classical control vector. The proof of the existence theorem of a continuous classical optimal control vector associated with the triple linear partial differential equations of parabolic type is given. The derivation of the Fréchet derivative for the cost function is obtained. At the end, the theorem of the necessary conditions for optimality of this problem is stated and is proved.

In this paper, author’s study sub diffusion bio heat transfer model and developed explicit finite difference scheme for time fractional sub diffusion bio heat transfer equation by using caputo fabrizio fractional derivative. Also discussed conditional stability and convergence of developed scheme. Furthermore numerical solution of time fractional sub diffusion bio heat transfer equation is obtained and it is represented graphically by Python.

In this paper, the continuous classical boundary optimal control problem (CCBOCP) for triple linear partial differential equations of parabolic type (TLPDEPAR) with initial and boundary conditions (ICs & BCs) is studied. The Galerkin method (GM) is used to prove the existence and uniqueness theorem of the state vector solution (SVS) for given continuous classical boundary control vector (CCBCV). The proof of the existence theorem of a continuous classical boundary optimal control vector (CCBOCV) associated with the TLPDEPAR is proved. The derivation of the Fréchet derivative (FrD) for the cost function (CoF) is obtained. At the end, the theorem of the necessary conditions for optimality (NCsThOP) of this problem is stated and prov

Prediction of the formation of pore and fracture pressure before constructing a drilling wells program are a crucial since it helps to prevent several drilling operations issues including lost circulation, kick, pipe sticking, blowout, and other issues. IP (Interactive Petrophysics) software is used to calculate and measure pore and fracture pressure. Eaton method, Matthews and Kelly, Modified Eaton, and Barker and Wood equations are used to calculate fracture pressure, whereas only Eaton method is used to measure pore pressure. These approaches are based on log data obtained from six wells, three from the north dome; BUCN-52, BUCN-51, BUCN-43 and the other from the south dome; BUCS-49, BUCS-48, BUCS-47. Along with the overburden pressur

     The idea of the paper is to consolidate Mahgoub transform and variational iteration method (MTVIM) to solve fractional delay differential equations (FDDEs). The fractional derivative was in Caputo sense. The convergences of approximate solutions to exact solution were quick. The MTVIM is characterized by ease of application in various problems and is capable of simplifying the size of computational operations.  Several non-linear (FDDEs) were analytically solved as illustrative examples and the results were compared numerically. The results for accentuating the efficiency, performance, and activity of suggested method were shown by comparisons with Adomian Decomposition Method (ADM), Laplace Adomian Decompos

In the present work, an image compression method have been modified by combining The Absolute Moment Block Truncation Coding algorithm (AMBTC) with a VQ-based image coding. At the beginning, the AMBTC algorithm based on Weber's law condition have been used to distinguish low and high detail blocks in the original image. The coder will transmit only mean of low detailed block (i.e. uniform blocks like background) on the channel instate of transmit the two reconstruction mean values and bit map for this block. While the high detail block is coded by the proposed fast encoding algorithm for vector quantized method based on the Triangular Inequality Theorem (TIE), then the coder will transmit the two reconstruction mean values (i.e. H&L)

This paper introduces the Multistep Modified Reduced Differential Transform Method (MMRDTM). It is applied to approximate the solution for Nonlinear Schrodinger Equations (NLSEs) of power law nonlinearity. The proposed method has some advantages. An analytical approximation can be generated in a fast converging series by applying the proposed approach. On top of that, the number of computed terms is also significantly reduced. Compared to the RDTM, the nonlinear term in this method is replaced by related Adomian polynomials prior to the implementation of a multistep approach. As a consequence, only a smaller number of NLSE computed terms are required in the attained approximation. Moreover, the approximation also converges rapidly over a

Precision is one of the main elements that control the quality of a geodetic network, which defines as the measure of the network efficiency in propagation of random errors. This research aims to solve ZOD and FOD problems for a geodetic network using Rosenbrock Method to optimize the geodetic networks by using MATLAB programming language, to find the optimal design of geodetic network with high precision. ZOD problem was applied to a case study network consists of 19 points and 58 designed distances with a priori deviation equal to 5mm, to determine the best points in the network to consider as control points. The results showed that P55 and P73 having the minimum ellipse of error and considered as control points. FOD problem was applie