The scheduling of jobs over a single machine with sequence dependent setups is a
classical problem setting that appears in many practical applications in production planning …

In this paper we consider $1//\sum^ n_ {j= 1}{(E_j+ T_j+ C_j+ U_j+ V_j)} $ problem, the
discussed problem is called a Multi objectives Function (MOF) problem, As objective is to …

In this research, we suggested the problem scheduling of n jobs on a single machine to
decrease schedule multi-objective function; the sum cost of total completion time, the total …

In this paper, we introduce one of the multi-criteria objectives function in machine scheduling
problem (MSP). Our problem is minimizing three functions: Total Completion Times, Range …

In this paper, we suggest a multi-objective Machine Scheduling Problem (MSP). The
discussed problem is the sum of total completion time, total tardiness, total earliness time …

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 …

In this paper, neural networks (NN) are implemented to manipulate a problem of machine
scheduling for a single machine to minimize multicriteria objective function: maximum …

In this paper, two of the local search algorithms are used (genetic algorithm and particle
swarm optimization), in scheduling number of products (n jobs) on a single machine to …

In this paper, we found some methods for solving one of the bicriteria machine scheduling
problems (BMSP). Our discussed problem is represented by the total completion and the …