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

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.

[1]  Panos M. Pardalos,et al.  A variable neighborhood search heuristic algorithm for production routing problems , 2018, Appl. Soft Comput..

[2]  Stéphane Dauzère-Pérès,et al.  Metaheuristics for the job-shop scheduling problem with machine availability constraints , 2018, Comput. Ind. Eng..

[3]  Daniele Vigo,et al.  An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping , 2013, Transp. Sci..

[4]  Xinyu Shao,et al.  MILP models for energy-aware flexible job shop scheduling problem , 2019, Journal of Cleaner Production.

[5]  Yang Liu,et al.  A hybrid harmony search algorithm with efficient job sequence scheme and variable neighborhood search for the permutation flow shop scheduling problems , 2017, Eng. Appl. Artif. Intell..

[6]  María R. Sierra,et al.  Memetic algorithms for the job shop scheduling problem with operators , 2015, Appl. Soft Comput..

[7]  Xin Yao,et al.  Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems , 2015, Inf. Sci..

[8]  Hamidreza Maghsoudlou,et al.  A multi-objective invasive weeds optimization algorithm for solving multi-skill multi-mode resource constrained project scheduling problem , 2016, Comput. Chem. Eng..

[9]  Amir Ahmadi-Javid,et al.  Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: A mathematical formulation and an Anarchic Society Optimization algorithm , 2017, Comput. Oper. Res..

[10]  Miguel A. Vega-Rodríguez,et al.  Applying the MOVNS (multi-objective variable neighborhood search) algorithm to solve the path planning problem in mobile robotics , 2016, Expert Syst. Appl..

[11]  Fuqing Zhao,et al.  A hybrid biogeography-based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem , 2019, Expert Syst. Appl..

[12]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

[13]  Ruifeng Shi,et al.  Multi-Objective Optimization of Electric Vehicle Fast Charging Stations with SPEA-II , 2015 .

[14]  Mostafa Zandieh,et al.  A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms , 2016, Comput. Oper. Res..

[15]  Jian Xiong,et al.  Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns , 2013 .

[16]  Cheng-Hsiang Liu,et al.  Reduction of power consumption and carbon footprints by applying multi-objective optimisation via genetic algorithms , 2014 .

[17]  Gary M. Thompson,et al.  Scheduling workforce relief breaks in advance versus in real-time , 2007, Eur. J. Oper. Res..

[18]  Jonathan F. Bard,et al.  Nurse scheduling with lunch break assignments in operating suites , 2016 .

[19]  Jeffrey Horn,et al.  Multi-objective optimal design of groundwater remediation systems: application of the niched Pareto genetic algorithm (NPGA) , 2002 .

[20]  Álvaro García-Sánchez,et al.  Flexible Job Shop Scheduling With Operators in Aeronautical Manufacturing: A Case Study , 2018, IEEE Access.

[21]  Liang Gao,et al.  An effective genetic algorithm for the flexible job-shop scheduling problem , 2011, Expert Syst. Appl..

[22]  Hong Zhou,et al.  Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem , 2013, Inf. Sci..

[23]  Kejia Zhuang,et al.  Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems , 2017, Comput. Ind. Eng..

[24]  Chao Zhang,et al.  Application of Grey Wolf Optimization for Solving Combinatorial Problems: Job Shop and Flexible Job Shop Scheduling Cases , 2018, IEEE Access.

[25]  Lei Wang,et al.  Distributed manufacturing resource selection strategy in cloud manufacturing , 2018 .

[26]  Kyrre Glette,et al.  Adaptive variable neighborhood search for solving multi-objective facility layout problems with unequal area facilities , 2013, Swarm Evol. Comput..

[27]  Tsung-Che Chiang,et al.  A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling , 2013 .

[28]  Seyed Taghi Akhavan Niaki,et al.  A soft-computing Pareto-based meta-heuristic algorithm for a multi-objective multi-server facility location problem , 2013, Appl. Soft Comput..

[29]  F. Jolai,et al.  A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem , 2014, The International Journal of Advanced Manufacturing Technology.

[30]  Ehsan Nikbakhsh,et al.  Robust closed-loop global supply chain network design under uncertainty: the case of the medical device industry , 2015 .

[31]  Deming Lei,et al.  Variable neighbourhood search for dual-resource constrained flexible job shop scheduling , 2014 .

[32]  Naiming Xie,et al.  Flexible job shop scheduling problem with interval grey processing time , 2018, Appl. Soft Comput..

[33]  X. Shao,et al.  A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem , 2010 .

[34]  Genichi Taguchi,et al.  Introduction to quality engineering.... , 2014 .

[35]  P. Hansen,et al.  Variable neighborhood search for the p-median , 1997 .

[36]  Mitsuo Gen,et al.  A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem , 2005, Comput. Ind. Eng..

[37]  M. Zandieh,et al.  Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—Variable neighborhood search approach , 2011 .

[38]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[39]  Tarek Y. ElMekkawy,et al.  Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm , 2011 .

[40]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[41]  Hadi Mokhtari,et al.  Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate , 2015, Comput. Oper. Res..

[42]  L. Vanneschi,et al.  Multi-objective genetic algorithm with variable neighbourhood search for the electoral redistricting problem , 2017, Swarm Evol. Comput..

[43]  Mostafa Zandieh,et al.  Flexible job-shop scheduling with parallel variable neighborhood search algorithm , 2010, Expert Syst. Appl..

[44]  Jingyao Li,et al.  A branch population genetic algorithm for dual-resource constrained job shop scheduling problem , 2016, Comput. Ind. Eng..

[45]  Ahmed Chiheb Ammari,et al.  Two stage particle swarm optimization to solve the flexible job shop predictive scheduling problem considering possible machine breakdowns , 2017, Comput. Ind. Eng..

[46]  Alain Martel,et al.  A variable neighborhood search heuristic for the design of multicommodity production–distribution networks with alternative facility configurations , 2011, OR Spectr..

[47]  Ching-Jong Liao,et al.  A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date , 2007, Comput. Ind. Eng..

[48]  Xinyu Li,et al.  An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem , 2016 .