Jaya algorithm for rescheduling flexible job shop problem with machine recovery

K. Z. Gao, M. C. Zhou, Y. X. Pan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This work addresses on flexible job shop rescheduling problem with machine recovery. The goal is to minimize the maximum machine workload and instability simultaneously. As an almost parameter-free metaheuristic, Jaya is used and developed to solve it. A local search operator and an initializing rule are developed for improving Jaya's performance. Ten cases from a remanufacturing company are solved to verify the proposed Jaya's performance. The comparisons and discussions show the effectiveness of the proposed Jaya for rescheduling flexible job shop with machine recovery.

Original languageEnglish (US)
Title of host publication2019 IEEE International Conference on Systems, Man and Cybernetics, SMC 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3660-3664
Number of pages5
ISBN (Electronic)9781728145693
DOIs
StatePublished - Oct 2019
Event2019 IEEE International Conference on Systems, Man and Cybernetics, SMC 2019 - Bari, Italy
Duration: Oct 6 2019Oct 9 2019

Publication series

NameConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
Volume2019-October
ISSN (Print)1062-922X

Conference

Conference2019 IEEE International Conference on Systems, Man and Cybernetics, SMC 2019
CountryItaly
CityBari
Period10/6/1910/9/19

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Human-Computer Interaction

Fingerprint Dive into the research topics of 'Jaya algorithm for rescheduling flexible job shop problem with machine recovery'. Together they form a unique fingerprint.

Cite this