A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem

作者：Torabi S A^*; Sahebjamnia N; Mansouri S A; Bajestani M Aramon

来源：Applied Soft Computing, 2013, 13(12): 4750-4762.

DOI：10.1016/j.asoc.2013.07.029

• Fuzzy mathematical programming
• Unrelated parallel machine scheduling
• Secondary resource constraints
• Multiple objective particle swarm optimization

This paper proposes a novel multi-objective model for an unrelated parallel machine scheduling problem considering inherent uncertainty in processing times and due dates. The problem is characterized by non-zero ready times, sequence and machine-dependent setup times, and secondary resource constraints for jobs. Each job can be processed only if its required machine and secondary resource (if any) are available at the same time. Finding optimal solution for this complex problem in a reasonable time using exact optimization tools is prohibitive. This paper presents an effective multi-objective particle swarm optimization (MOPSO) algorithm to find a good approximation of Pareto frontier where total weighted flow time, total weighted tardiness, and total machine load variation are to be minimized simultaneously. The proposed MOPSO exploits new selection regimes for preserving global as well as personal best solutions. Moreover, a generalized dominance concept in a fuzzy environment is employed to find locally Pareto-optimal frontier. Performance of the proposed MOPSO is compared against a conventional multiobjective particle swarm optimization (CMOPSO) algorithm over a number of randomly generated test problems. Statistical analyses based on the effect of each algorithm on each objective space show that the proposed MOPSO outperforms the CMOPSO in terms of quality, diversity and spacing metrics.

• 出版日期2013-12