Sharif Digital Repository

This research deals with the problem of scheduling independent preemptive jobs on identical parallel machines, to minimize the total completion time (makespan). The transportation of an interrupted job from a machine to another machine requires considering a constant transportation delay i.e., Pm|prmp(delay)| Cmax. This delay is called transportation delay. We propose a Mixed Integer Linear Programming formulation for the research problem in case of two machines i.e., P2|prmp(delay)| Cmax. Since the research problem is shown to be NP-hard, a particle swarm optimization (PSO) algorithm is applied to solve the problem approximately. Based on the frequency of using local search procedure, three...