Jaya algorithm for rescheduling flexible job shop problem with machine recovery

Document Type

Conference Proceeding

Publication Date

10-1-2019

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.

Identifier

85076730887 (Scopus)

ISBN

[9781728145693]

Publication Title

Conference Proceedings IEEE International Conference on Systems Man and Cybernetics

External Full Text Location

https://doi.org/10.1109/SMC.2019.8914026

ISSN

1062922X

First Page

3660

Last Page

3664

Volume

2019-October

Grant

61503170

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS