Review paper
A Pareto based discrete Jaya algorithm for multi-objective flexible job shop scheduling problem
Abstract
Research on the development of Pareto-based multi-objective algorithms to address scheduling problems has attracted a lot of attention in recent years. In this work, a multi-objective discrete Jaya algorithm (MODJA) is proposed to address the flexible job shop scheduling problem (FJSSP) considering the minimization of makespan, total workload of machines, and workload of critical machine as performance measures. A discrete Jaya algorithm is...
Paper Details
Title
A Pareto based discrete Jaya algorithm for multi-objective flexible job shop scheduling problem
Published Date
Jan 8, 2021
Volume
170
Pages
114567 - 114567
TrendsPro
You’ll need to upgrade your plan to Pro
Looking to understand a paper’s academic impact over time?
- Scinapse’s Citation Trends graph enables the impact assessment of papers in adjacent fields.
- Assess paper quality within the same journal or volume, irrespective of the year or field, and track the changes in the attention a paper received over time.
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.