A Hybrid Multi-Objective Evolutionary Algorithm with Heuristic Adjustment Strategies and Variable Neighbor-Hood Search for Flexible Job-Shop Scheduling Problem Considering Flexible Rest Time

15Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

With the development of society, people have a higher demand for the work environment. It has aroused extensive attention of enterprises. One of the most important demands for workers is to have enough rest time to regain strength and energy during the working day. In this paper, a comprehensive mathematical model is established for the multi-objective flexible job-shop scheduling problem with flexible rest time (MOFJSP-FRT). Then a hybrid multi-objective evolutionary algorithm (MOEA) with heuristic adjustment strategies and variable neighborhood search (VNS), named HMOEAV, is proposed to solve the MOFJSP-FRT with the objectives to minimize the makespan and the machines loads balancing simultaneously. In the proposed hybrid algorithm, the machine-based encoding scheme is designed to improve search effectiveness by reducing computational complexity. Two heuristic adjustment strategies considering both the problem characteristics and the objective features are employed to initialize a high-quality population. To adequately emphasize the local exploitation ability of MOEA, VNS is incorporated into it. The non-dominated solutions got by MOEA are the initial solutions for VNS, in which three types of neighborhood structures according to problem structures are designed. The practical case in a steel structure enterprise is carried out to demonstrate the effectiveness of the proposed model and hybrid algorithm. The influences of rest time length on the MOFJSP-FRT are analyzed to give enterprises new insights to improve the scheduling efficiency while ensuring that employees have enough time to rest.

References Powered by Scopus

A fast and elitist multiobjective genetic algorithm: NSGA-II

40516Citations
N/AReaders
Get full text

Job-shop scheduling with multi-purpose machines

616Citations
N/AReaders
Get full text

A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems

485Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Flexible job shop scheduling problem under Industry 5.0: A survey on human reintegration, environmental consideration and resilience improvement

102Citations
N/AReaders
Get full text

A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times

63Citations
N/AReaders
Get full text

Improved Initialization Method for Metaheuristic Algorithms: A Novel Search Space View

24Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Sun, X., Guo, S., Guo, J., & Du, B. (2019). A Hybrid Multi-Objective Evolutionary Algorithm with Heuristic Adjustment Strategies and Variable Neighbor-Hood Search for Flexible Job-Shop Scheduling Problem Considering Flexible Rest Time. IEEE Access, 7, 157003–157018. https://doi.org/10.1109/ACCESS.2019.2948057

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 9

47%

Lecturer / Post doc 6

32%

Professor / Associate Prof. 2

11%

Researcher 2

11%

Readers' Discipline

Tooltip

Computer Science 9

53%

Engineering 6

35%

Materials Science 1

6%

Economics, Econometrics and Finance 1

6%

Save time finding and organizing research with Mendeley

Sign up for free