[PDF][PDF] Minimizing the total completion time and total earliness time functions for a machine scheduling problem using local search methods
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() …
Simulated Annealing (SA) and Particle Swarm Optimization (PSO), to solve the problems() …
[PDF][PDF] Solving Flow Shop Problem to Minimize Total Completion Time with Total or Maximum Tardiness
ST Hasson, SM Yousif - 2015 - researchgate.net
This paper aims to minimize two flow shop problems; first is the total completion time with
total tardiness (Fm//ΣC+ΣTj), and the second is the total completion time with maximum …
total tardiness (Fm//ΣC+ΣTj), and the second is the total completion time with maximum …