In this paper, we studied the scheduling of  jobs on a single machine.  Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi

In this paper, we deal with games of fuzzy payoffs problem while there is uncertainty in data. We use the trapezoidal membership function to transform the data into fuzzy numbers and utilize the three different ranking function algorithms. Then we compare between these three ranking algorithms by using trapezoidal fuzzy numbers for the decision maker to get the best gains

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti

A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte

In this research, a new application has been developed for games by using the generalization of the separation axioms in topology, in particular regular, Sg-regular and SSg- regular spaces. The games under study consist of two players and the victory of the second player depends on the strategy and choice of the first player. Many regularity, Sg, SSg regularity theorems have been proven using this type of game, and many results and illustrative examples have been presented

We introduce some new generalizations of some definitions which are, supra closure converge to a point, supra closure directed toward a set, almost supra converges to a set, almost supra cluster point, a set supra H-closed relative, supra closure continuous functions, supra weakly continuous functions, supra compact functions, supra rigid a set, almost supra closed functions and supra perfect functions. And we state and prove several results concerning it

This paper contains an equivalent statements of a pre-  space, where  are considered subsets of with the product topology. An equivalence relation between the preclosed set  and a pre-  space, and a relation between a pre-  space and the preclosed set  with some conditions on a function  are found. In addition, we have proved that the graph  of  is preclosed in if  is a pre-  space, where the equivalence relation  on  is open.

     On the other hand, we introduce the definition of a pre-stable ( pre-stable) set by depending on the concept of a pre-neighborhood, where we get that every stable set is pre-stable. Moreover, we obtain that

        In our research, we introduced new concepts, namely ^*and **-light mappings, after we knew ^*and **-totally disconnected mappings through the use of -open sets.

Many examples, facts, relationships and results have been given to support our work.

Design sampling plan was and still one of most importance subjects because it give lowest cost  comparing with others, time live statistical distribution should be known to give best estimators for  parameters of sampling plan and get best sampling plan.

Research dell with design sampling plan when live time distribution follow Logistic distribution with () as location and shape parameters, using these information can help us getting (number of groups, sample size) associated with reject or accept the Lot

Experimental results for simulated data shows the least number of groups and sample size needs to reject or accept the Lot with certain probability of