Preferred Language
Articles
/
ijs-2087
Minimizing the Total Completion Time and Total Earliness Time Functions for a Machine Scheduling Problem Using Local Search Methods
...Show More Authors

In this paper we investigate the use of two types of local search methods (LSM), the Simulated Annealing (SA) and Particle Swarm Optimization (PSO), to solve the problems ( ) and . The results of the two LSMs are compared with the Branch and Bound method and good heuristic methods. This work shows the good performance of SA and PSO compared with the exact and heuristic methods in terms of best solutions and CPU time.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Tue Oct 20 2020
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Fuzzy Semimaximal Submodules
...Show More Authors

     Let R be a commutative ring with unity and an R-submodule N is called semimaximal if and only if

 the sufficient conditions of F-submodules to be semimaximal .Also the concepts of (simple , semisimple) F- submodules and quotient F- modules are  introduced and given some  properties .

View Publication Preview PDF
Crossref (1)
Crossref