Within this research, The problem of scheduling jobs on a single machine is the subject of study to minimize the multi-criteria and multi-objective functions. The first problem, minimizing the multi-criteria, which include Total Completion Time, Total Late Work, and Maximum Earliness Time (∑𝐶𝑗, ∑𝑉𝑗, 𝐸𝑚𝑎𝑥), and the second problem, minimizing the multi-objective functions ∑𝐶𝑗 + ∑𝑉𝑗 +𝐸𝑚𝑎𝑥 are the problems at hand in this paper. In this study, a mathematical model is created to address the research problems, and some rules provide efficient (optimal) solutions to these problems. It has also been proven that each optimal solution for ∑𝐶𝑗 + ∑𝑉𝑗 + 𝐸𝑚𝑎𝑥 is an effic

Machine scheduling problems (MSP) are     considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as  are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutio

In this paper, Min-Max composition fuzzy relation equation are studied. This study is a generalization of the works of Ohsato and Sekigushi. The conditions for the existence of solutions are studied, then the resolution of equations is discussed.

The main aim of this paper is to introduce the concept of a Fuzzy Internal Direct Product of fuzzy subgroups of group . We study some properties and prove some theorems about this concept ,which is very important and interesting of fuzzy groups and very useful in applications of fuzzy mathematics in general and especially in fuzzy groups.

in this paper the notion of threshold relations by using resemblance relation are introduced to get a similarity relation from a resemnblance relation R

The purpose of this paper is to define fuzzy subspaces for fuzzy space of orderings and we prove some results about this definition in which it leads to a lot of new results on fuzzy space of orderings. Also we define the sum and product over such spaces such that: If f = < a1,…,an > and g = < b1,…bm>, their sum and product are f + g = < a1…,an, b1, …, bm> and f × g =. for all a1,…,an,b1,…,bm ? G

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, we study the scheduling of jobs on a single machine. Each of the n jobs will be processed without interruption and becomes available for processing at time zero. The goal is to find a processing order for the jobs, minimizing the total completion time, total late work, total earliness time, and maximum earliness maximum tardiness. The posed problems in this paper are as follows: The first problem is to minimize the multi-criteria, which includes minimizing the total completion time, total late work, total earliness time, maximum earliness, and maximum tardiness that are denoted by , respectively. The second problem is to minimize the multi-objective functions ( ). The theoretical section will present the mathematical formu