Particle Swarm Optimization to Solve Unrelated Parallel Machine Scheduling Problems

Abstract

Abstract The problem of unrelated parallel machines scheduling is very important in this industry. Scheduling is useful to save company resources, one of which is in terms of time. With minimization of completion time, companies can fulfill it quickly and precisely. Focuses on unrelated parallel machine scheduling problems that depend on sequences aimed at minimizing total turnaround time by considering setup time. This paper presents how unrelated parallel machine scheduling using the particle swarm optimization algorithm approach. The experimental results obtained indicate the optimum value.