Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.

We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑

In this paper, we will illustrate a gamma regression model assuming that the dependent variable (Y) is a gamma distribution and that it's mean ( ) is related through a linear predictor with link function which is identity link function g(μ) = μ. It also contains the shape parameter which is not constant and depends on the linear predictor and with link function which is the log link and we will estimate the parameters of gamma regression by using two estimation methods which are The Maximum Likelihood and the Bayesian and a comparison between these methods by using the standard comparison of average squares of error (MSE), where the two methods were applied to real da

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

This paper investigates the capacitated vehicle routing problem (CVRP) as it is one of the numerous issues that have no impeccable solutions yet. Numerous scientists in the recent couple of decades have set up various explores and utilized numerous strategies with various methods to deal with it. However, for all researches, finding the least cost is exceptionally complicated. In any case, they have figured out how to think of rough solutions that vary in efficiencies relying upon the search space. Furthermore, tabu search (TS) is utilized to resolve this issue as it is fit for solving numerous complicated issues. The algorithm has been adjusted to resolve the exploration issue, where its methodology is not quite the same as the normal a

While analytical solutions to Quadratic Assignment Problems (QAP) have indeed been since a long time, the expanding use of Evolutionary Algorithms (EAs) for similar issues gives a framework for dealing with QAP with an extraordinarily broad scope. The study's key contribution is that it normalizes all of the criteria into a single scale, regardless of their measurement systems or the requirements of minimum or maximum, relieving the researchers of the exhaustively quantifying the quality criteria. A tabu search algorithm for quadratic assignment problems (TSQAP) is proposed, which combines the limitations of tabu search with a discrete assignment problem. The effectiveness of the proposed technique has been compared to well-established a

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

In this paper, the effective computational method (ECM) based on the standard monomial polynomial has been implemented to solve the nonlinear Jeffery-Hamel flow problem. Moreover, novel effective computational methods have been developed and suggested in this study by suitable base functions, namely Chebyshev, Bernstein, Legendre, and Hermite polynomials. The utilization of the base functions converts the nonlinear problem to a nonlinear algebraic system of equations, which is then resolved using the Mathematica^®12 program. The development of effective computational methods (D-ECM) has been applied to solve the nonlinear Jeffery-Hamel flow problem, then a comparison between the methods has been shown. Furthermore, the maximum

This paper presents a grey model GM(1,1) of the first rank and a variable one and is the basis of the grey system theory , This research dealt  properties of grey model and a set of methods to estimate parameters of the grey model GM(1,1)  is the least square Method (LS) , weighted least square method (WLS), total least square method (TLS) and gradient descent method  (DS). These methods were compared based on two types of standards: Mean square error (MSE), mean absolute percentage error (MAPE), and after comparison using simulation the best method was applied to real data represented by the rate of consumption of the two types of oils a Heavy fuel (HFO) and diesel fuel (D.O) and has been applied several tests to

The purpose of this paper is applying the robustness in Linear programming(LP) to get rid of uncertainty problem in constraint parameters, and find the robust optimal solution, to maximize the profits of the general productive company of vegetable oils for the year 2019, through the modify on a mathematical model of linear programming when some parameters of the model have uncertain values, and being processed it using robust counterpart of linear programming to get robust results from the random changes that happen in uncertain values ​​of the problem, assuming these values belong to the uncertainty set and selecting the values that cause the worst results and to depend buil