Modified JAYA algorithm for solving the flexible job shop scheduling problem considering worker flexibility and energy consumption
by Hongchan Li; Haodong Zhu; Tianhua Jiang
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 20, No. 3, 2021

Abstract: This paper investigates a flexible job shop scheduling problem with worker flexibility and energy consumption. A modified JAYA algorithm (MJAYA) is developed to minimise the total energy consumption. In the MJAYA, three improvement strategies are used to improve the algorithm's performance, such as Modified Individual Updating (MIU) method, Adaptive Mutation Operator (AMO) and Local Search Strategy (LSS). The MIU is developed to improve the exploration ability by adding a random term to the original updating equation. The AMO is used to keep the population diversity. In addition, The LSS is employed to enhance the local search capacity. Finally, extensive simulations are performed to validate the effectiveness of the proposed MJAYA algorithm. Experimental data show that the MJAYA algorithm is effective for solving the considered problem.

Online publication date: Tue, 15-Jun-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com