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

A hybrid particulate swarm optimization (hybrid) combination of an optimization algorithm of the particle swarm and a variable neighborhood search algorithm is proposed for the multi-objective permutation flow shop scheduling problem (PFSP) with the smallest cumulative completion time and the smallest total flow time. Algorithm for hybrid particulate swarm optimization (HPSO) is applied to maintain a fair combination of centralized search with decentralized search. The Nawaz-Enscore-Ham )NEH) heuristic algorithm in this hybrid algorithm is used to initialize populations in order to improve the efficiency of the initial solution. The method design is based on ascending order (ranked-order-value, ROV), applying the continuous PSO algorithm

In this paper, we investigate some methods to solve one of the multi-criteria machine scheduling problems. The discussed problem is the total completion time and the total earliness jobs  To solve this problem, some heuristic methods are proposed which provided good results. The Branch and Bound (BAB) method is applied with new suggested upper and lower bounds to solve the discussed problem, which produced exact results for  in a reasonable time.

Flexible job-shop scheduling problem (FJSP) is one of the instances in flexible manufacturing systems. It is considered as a very complex to control. Hence generating a control system for this problem domain is difficult. FJSP inherits the job-shop scheduling problem characteristics. It has an additional decision level to the sequencing one which allows the operations to be processed on any machine among a set of available machines at a facility. In this article, we present Artificial Fish Swarm Algorithm with Harmony Search for solving the flexible job shop scheduling problem. It is based on the new harmony improvised from results obtained by artificial fish swarm algorithm. This improvised solution is sent to comparison to an overall best

     In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr

     In this paper, we consider a two-phase Stefan problem in one-dimensional space for parabolic heat equation with non-homogenous Dirichlet boundary condition. This problem contains a free boundary depending on time. Therefore, the shape of the problem is changing with time. To overcome this issue, we use a simple transformation to convert the free-boundary problem to a fixed-boundary problem. However, this transformation yields a complex and nonlinear parabolic equation. The resulting equation is solved by the finite difference method with Crank-Nicolson scheme which is unconditionally stable and second-order of accuracy in space and time. The numerical results show an excellent accuracy and stable solutions for tw

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 minimize a multi-objective function which is denoted as  (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.

Purpose: The main objective of this paper is, to determine the optimal no. of technicians’ men in a workshop crew of an Industrial System.   Theoretical framework: The purpose of applying these tools is to explore their ability to reduce costs and improvements that can be obtained in the process of providing services to the end customer.   Design/methodology/approach: The literature structure review was built from analyzing 12 of scientific papers and books, from web sciences and the Elsevier database. The papers were analyzed from descriptive, methodologic, and citation characteristics.   Finding:  By applying the equation model of the paper, the optimal no. of technician men in the crew of the workshop can be determined when