Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/32140
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: A multi objective volleyball premier league algorithm for green scheduling identical parallel machines with splitting jobs
Author(s): Salimifard, Khodakaram
Li, Jingpeng
Mohammadi, Davood
Moghdani, Reza
Keywords: Parallel machine scheduling
Splitting jobs
Wastes
Total tardiness
Multi-objective optimisation
Volleyball premier league
Issue Date: 8-Dec-2020
Date Deposited: 8-Jan-2021
Citation: Salimifard K, Li J, Mohammadi D & Moghdani R (2020) A multi objective volleyball premier league algorithm for green scheduling identical parallel machines with splitting jobs. Applied Intelligence. https://doi.org/10.1007/s10489-020-02027-1
Abstract: 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.
DOI Link: 10.1007/s10489-020-02027-1
Rights: This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
Notes: Output Status: Forthcoming/Available Online
Licence URL(s): http://creativecommons.org/licenses/by/4.0/

Files in This Item:
File Description SizeFormat 
Salimifard2020_Article_AMultiObjectiveVolleyballPremi.pdfFulltext - Published Version2.98 MBAdobe PDFView/Open



This item is protected by original copyright



A file in this item is licensed under a Creative Commons License Creative Commons

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.