Scheduling problems have been treated as single criterion problems until recently. Many of these problems are computationally hard to solve three as single criterion problems. However, there is a need to consider multiple criteria in a real life scheduling problem in general. In this paper, we study the problem of scheduling jobs on a single machine to minimize total tardiness subject to maximum earliness or tardiness for each job. And we give algorithm (ETST) to solve the first problem (p1) and algorithm (TEST) to solve the second problem (p2) to find an efficient solution.  

This paper proposes a new algorithm (F2SE) and algorithm (Alg(n – 1)) for solving the
two-machine flow shop problem with the objective of minimizing total earliness. This
complexity result leads us to use an enumeration solution approach for the algorithm (F2SE)
and (DM) is more effective than algorithm Alg( n – 1) to obtain approximate solution.

The tax is a financial amount collected from the taxpayer for the account of the public treasury.. and is the cornerstone of the close bond between members of the community and the country in which they live , as income tax is imposed on the profits and revenues achieved by people and often the constitution of most contemporary countries stipulate that the legislator is obligated to determine the sources of revenues and profits subjected to tax. Because the tax has a serious impact on people’s money because it is exposed to that money through direct deduction . Therefore, we note that the applicable income Tax Law stipulated that in order income to be subject to tax , it must be derived from one or more of the income sources st

The transportation problem (TP) is employed in many different situations, such as scheduling, performance, spending, plant placement, inventory control, and employee scheduling. When all variables, including supply, demand, and unit transportation costs (TC), are precisely known, effective solutions to the transportation problem can be provided. However, understanding how to investigate the transportation problem in an uncertain environment is essential. Additionally, businesses and organizations should seek the most economical and environmentally friendly forms of transportation, considering the significance of environmental issues and strict environmental legislation. This research employs a novel ranking function to solve the transpor

The traveling salesman problem (TSP) is a well-known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. In this paper we exploit the TSP to evaluate the minimum total cost (distance or time) for Iraqi cities. So two main methods are investigated to solve this problem; these methods are; Dynamic Programming (DP) and Branch and Bound Technique (BABT). For the BABT, more than one lower and upper bounds are be derived to gain the best one. The results of BABT are completely identical to DP, with less time for number of cities (n), 5 ≤ n ≤ 25. These results proof the efficiency of BABT compared with so

UML (Unfiled Modeling Language), known as the standard method for object-oriented (analysis and design) modeling, includes other languages which enables it to implement a prototype of the structure and behaviors of the product. This paper attempts to explore the observations about UML role on the cost of software maintenance, and hence on the Total Cost of Ownership (TCO) of a software product. It is therefore important to investigate the benefits obtained through modeling..

In this research, the problem of ambiguity of the data for the project of establishing the typical reform complex in Basrah Governorate was eliminated. The blurry of the data represented by the time and cost of the activities was eliminated by using the Ranking function and converting them into normal numbers. Scheduling and managing the Project in the Critical Pathway (CPM) method to find the project completion time in normal conditions in the presence of non-traditional relationships between the activities and the existence of the lead and lag periods. The MS Project was used to find the critical path. The results showed that the project completion time (1309.5) dinars and the total cost has reached (33113017769) dinars and the

     In this paper, the bi-criteria machine scheduling problems (BMSP) are solved, where the discussed problem is represented by the sum of completion and the sum of late work times  simultaneously. In order to solve the suggested BMSP, some metaheurisitc methods are suggested which produce good results. The suggested local search methods are simulated annulling and bees algorithm. The results of the new metaheurisitc methods are compared with the complete enumeration method, which is considered an exact method, then compared results of the heuristics with each other to obtain the most efficient method.

Today’s academics have a major hurdle in solving combinatorial problems in the actual world. It is nevertheless possible to use optimization techniques to find, design, and solve a genuine optimal solution to a particular problem, despite the limitations of the applied approach. A surge in interest in population-based optimization methodologies has spawned a plethora of new and improved approaches to a wide range of engineering problems. Optimizing test suites is a combinatorial testing challenge that has been demonstrated to be an extremely difficult combinatorial optimization limitation of the research. The authors have proposed an almost infallible method for selecting combinatorial test cases. It uses a hybrid whale–gray wol

Sand production in unconsolidated reservoirs has become a cause of concern for production engineers. Issues with sand production include increased wellbore instability and surface subsidence, plugging of production liners, and potential damage to surface facilities. A field case in southeast Iraq was conducted to predict the critical drawdown pressures (CDDP) at which the well can produce without sanding. A stress and sanding onset models were developed for Zubair reservoir. The results show that sanding risk occurs when rock strength is less than 7,250 psi, and the ratio of shear modulus to the bulk compressibility is less than 0.8 1012 psi2. As the rock strength is increased, the sand free drawdown and depletion becomes larger. The CDDP