In this review paper, JAYA algorithm, which is a recent population-based algorithm is
intensively overviewed. The JAYA algorithm combines the survival of the fittest principle from …

An iterated greedy algorithm (IGA) is a simple and powerful heuristic algorithm. It is widely
used to solve flow-shop scheduling problems (FSPs), an important branch of production …

Carbon peaking and carbon neutrality, which are the significant national strategy for
sustainable development, have attracted considerable attention from production enterprises …

Personalized orders bring challenges to the production paradigm, and there is an urgent
need for the dynamic responsiveness and self-adjustment ability of the workshop …

As an important branch of production scheduling, flexible job-shop scheduling problem
(FJSP) is difficult to solve and is proven to be NP-hard. Many intelligent algorithms have …

In this study, a self-learning discrete Jaya algorithm (SD-Jaya) is proposed to address the
energy-efficient distributed no-idle flow-shop scheduling problem (FSP) in a heterogeneous …

Green flexible job-shop scheduling problem (FJSP) aims to improve profit and reduce
energy consumption for modern manufacturing. Meanwhile, FJSP with type-2 fuzzy …

Group scheduling problems have attracted much attention owing to their many practical
applications. This work proposes a new bi-objective serial-batch group scheduling problem …

In order to carry out the evaluation, control and maximum power point tracking on
photovoltaic (PV) systems, accurate and reliable model parameter identification of PV cell …

A distributed flow-shop scheduling problem with lot-streaming that considers completion
time and total energy consumption is addressed. It requires to optimally assign jobs to …