A multi objective volleyball premier league algorithm for green scheduling identical parallel machines with splitting jobs

Khodakaram Salimifard, Jingpeng Li, Davood Mohammadi, Reza Moghdani

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)


Parallel machine scheduling is one of the most common studied problems in recent years, however, this classic optimization problem has to achieve two conflicting objectives, i.e. minimizing the total tardiness and minimizing the total wastes, if the scheduling is done in the context of plastic injection industry where jobs are splitting and molds are important constraints. This paper proposes a mathematical model for scheduling parallel machines with splitting jobs and resource constraints. Two minimization objectives - the total tardiness and the number of waste - are considered, simultaneously. The obtained model is a bi-objective integer linear programming model that is shown to be of NP-hard class optimization problems. In this paper, a novel Multi-Objective Volleyball Premier League (MOVPL) algorithm is presented for solving the aforementioned problem. This algorithm uses the crowding distance concept used in NSGA-II as an extension of the Volleyball Premier League (VPL) that we recently introduced. Furthermore, the results are compared with six multi-objective metaheuristic algorithms of MOPSO, NSGA-II, MOGWO, MOALO, MOEA/D, and SPEA2. Using five standard metrics and ten test problems, the performance of the Pareto-based algorithms was investigated. The results demonstrate that in general, the proposed algorithm has supremacy than the other four algorithms.

Original languageEnglish
Pages (from-to)4143-4161
Number of pages19
JournalApplied Intelligence
Issue number7
Early online date8 Dec 2020
Publication statusPublished - 1 Jul 2021
Externally publishedYes

Cite this