AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (2.3 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

Biased Bi-Population Evolutionary Algorithm for Energy-Efficient Fuzzy Flexible Job Shop Scheduling with Deteriorating Jobs

School of Information Science and Engineering, Harbin Institute of Technology, Weihai 264209, China
Department of Computer Science, Maynooth University, Maynooth, W23 F2H6, Ireland, and also with the School of Computing, Dublin City University, Dublin, D09 V209, Ireland
Show Author Information

Abstract

There are many studies about flexible job shop scheduling problem with fuzzy processing time and deteriorating scheduling, but most scholars neglect the connection between them, which means the purpose of both models is to simulate a more realistic factory environment. From this perspective, the solutions can be more precise and practical if both issues are considered simultaneously. Therefore, the deterioration effect is treated as a part of the fuzzy job shop scheduling problem in this paper, which means the linear increase of a certain processing time is transformed into an internal linear shift of a triangle fuzzy processing time. Apart from that, many other contributions can be stated as follows. A new algorithm called reinforcement learning based biased bi-population evolutionary algorithm (RB2EA) is proposed, which utilizes Q-learning algorithm to adjust the size of the two populations and the interaction frequency according to the quality of population. A local enhancement method which combimes multiple local search stratgies is presented. An interaction mechanism is designed to promote the convergence of the bi-population. Extensive experiments are designed to evaluate the efficacy of RB2EA, and the conclusion can be drew that RB2EA is able to solve energy-efficient fuzzy flexible job shop scheduling problem with deteriorating jobs (EFFJSPD) efficiently.

References

[1]
IRENA, Global energy transformation: A roadmap to 2050, https://www.h2knowledgecentre.com/content/researchpaper1605, 2019.
[2]

S. Wang, M. Liu, F. Chu, and C. Chu, Bi-objective optimization of a single machine batch scheduling problem with energy cost consideration, J. Clean. Prod., vol. 137, pp. 1205–1215, 2016.

[3]

S. Zhang, A. Che, X. Wu, and C. Chu, Improved mixed-integer linear programming model and heuristics for bi-objective single-machine batch scheduling with energy cost consideration, Eng. Optim., vol. 50, no. 8, pp. 1380–1394, 2018.

[4]

S. Assia, I. E. Abbassi, A. E. Barkany, M. Darcherif, and A. E. Biyaali, Green scheduling of jobs and flexible periods of maintenance in a two-machine flowshop to minimize makespan, a measure of service level and total energy consumption, Adv. Oper. Res., vol. 2020, pp. 1–9, 2020.

[5]

K. Fang, W. Luo, and A. Che, Speed scaling in two-machine lot-streaming flow shops with consistent sublots, J. Oper. Res. Soc., vol. 72, no. 11, pp. 2429–2441, 2021.

[6]

L. P. Cota, V. N. Coelho, F. G. Guimarães, and M. J. F. Souza, Bi-criteria formulation for green scheduling with unrelated parallel machines with sequence-dependent setup times, Int. Trans. Oper. Res., vol. 28, no. 2, pp. 996–1017, 2021.

[7]

H. Zhang, Y. Wu, R. Pan, and G. Xu, Two-stage parallel speed-scaling machine scheduling under time-of-use tariffs, J. Intell. Manuf., vol. 32, no. 1, pp. 91–112, 2021.

[8]

F. Zhao, X. He, and L. Wang, A two-stage cooperative evolutionary algorithm with problem-specific knowledge for energy-efficient scheduling of no-wait flow-shop problem, IEEE Trans. Cybern., vol. 51, no. 11, pp. 5291–5303, 2021.

[9]

F. Zhao, R. Ma, and L. Wang, A self-learning discrete jaya algorithm for multiobjective energy-efficient distributed no-idle flow-shop scheduling problem in heterogeneous factory system, IEEE Trans. Cybern., vol. 52, no. 12, pp. 12675–12686, 2022.

[10]

H. X. Qin, Y. Y. Han, B. Zhang, L. L. Meng, Y. P. Liu, Q. K. Pan, and D. W. Gong, An improved iterated greedy algorithm for the energy-efficient blocking hybrid flow shop scheduling problem, Swarm Evol. Comput., vol. 69, p. 100992, 2022.

[11]

A. Goli, A. Ala, and M. Hajiaghaei-Keshteli, Efficient multi-objective meta-heuristic algorithms for energy-aware non-permutation flow-shop scheduling problem, Expert Syst. Appl., vol. 213, p. 119077, 2023.

[12]

X. Wu, Z. Cao, and S. Wu, Real-time hybrid flow shop scheduling approach in smart manufacturing environment, Complex System Modeling and Simulation, vol. 1, no. 4, pp. 335–350, 2021.

[13]

F. Zhao, B. Zhu, and L. Wang, An estimation of distribution algorithm-based hyper-heuristic for the distributed assembly mixed no-idle permutation flowshop scheduling problem, IEEE Trans. Syst. Man Cybern, Syst., vol. 53, no. 9, pp. 5626–5637, 2023.

[14]

J. Y. Moon and J. Park, Smart production scheduling with time-dependent and machine-dependent electricity cost by considering distributed energy resources and energy storage, Int. J. Prod. Res., vol. 52, no. 13, pp. 3922–3939, 2014.

[15]

D. Lei, Y. Zheng, and X. Guo, A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption, Int. J. Prod. Res., vol. 55, no. 11, pp. 3126–3140, 2017.

[16]

X. Wu and Y. Sun, A green scheduling algorithm for flexible job shop with energy-saving measures, J. Clean. Prod., vol. 172, pp. 3249–3264, 2018.

[17]

S. Luo, L. Zhang, and Y. Fan, Energy-efficient scheduling for multi-objective flexible job shops with variable processing speeds by grey wolf optimization, J. Clean. Prod., vol. 234, pp. 1365–1384, 2019.

[18]

L. Meng, C. Zhang, X. Shao, and Y. Ren, MILP models for energy-aware flexible job shop scheduling problem, J. Clean. Prod., vol. 210, pp. 710–723, 2019.

[19]

M. Li and D. Lei, An imperialist competitive algorithm with feedback for energy-efficient flexible job shop scheduling with transportation and sequence-dependent setup times, Eng. Appl. Artif. Intell., vol. 103, p. 104307, 2021.

[20]

H. Qin, Y. Han, Q. Chen, L. Wang, Y. Wang, J. Li, and Y. Liu, Energy-efficient iterative greedy algorithm for the distributed hybrid flow shop scheduling with blocking constraints, IEEE Trans. Emerg. Top. Comput. Intell., vol. 7, no. 5, pp. 1442–1457, 2023.

[21]

M. Dai, D. Tang, A. Giret, and M. A. Salido, Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints, Robot. Comput. Integr. Manuf., vol. 59, pp. 143–157, 2019.

[22]

Z. Pan, D. Lei, and L. Wang, A bi-population evolutionary algorithm with feedback for energy-efficient fuzzy flexible job shop scheduling, IEEE Trans. Syst. Man Cybern, Syst., vol. 52, no. 8, pp. 5295–5307, 2022.

[23]

R. Li, W. Gong, and C. Lu, A reinforcement learning based RMOEA/D for bi-objective fuzzy flexible job shop scheduling, Expert Syst. Appl., vol. 203, p. 117380, 2022.

[24]

J. Q. Li, Z. M. Liu, C. Li, and Z. X. Zheng, Improved artificial immune system algorithm for type-2 fuzzy flexible job shop scheduling problem, IEEE Trans. Fuzzy Syst., vol. 29, no. 11, p. 3234–3248, 2021.

[25]

F. Zhao, Z. Xu, L. Wang, N. Zhu, T. Xu, and J. Jonrinaldi, A population-based iterated greedy algorithm for distributed assembly no-wait flow-shop scheduling problem, IEEE Trans. Ind. Inf., vol. 19, no. 5, pp. 6692–6705, 2023.

[26]

L. Sun, L. Lin, M. Gen, and H. Li, A hybrid cooperative coevolution algorithm for fuzzy flexible job shop scheduling, IEEE Trans. Fuzzy Syst., vol. 27, no. 5, pp. 1008–1022, 2019.

[27]

J. Lin, Backtracking search based hyper-heuristic for the flexible job-shop scheduling problem with fuzzy processing time, Eng. Appl. Artif. Intell., vol. 77, pp. 186–196, 2019.

[28]

J. Cai and D. Lei, A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time, Complex Intell. Syst., vol. 7, no. 5, pp. 2235–2253, 2021.

[29]

R. Li, W. Gong, and C. Lu, Self-adaptive multi-objective evolutionary algorithm for flexible job shop scheduling with fuzzy processing time, Comput. Ind. Eng., vol. 168, p. 108099, 2022.

[30]

Y. Dorfeshan, R. Tavakkoli-Moghaddam, S. M. Mousavi, and B. Vahedi-Nouri, A new weighted distance-based approximation methodology for flow shop scheduling group decisions under the interval-valued fuzzy processing time, Appl. Soft Comput., vol. 91, p. 106248, 2020.

[31]

R. Li, W. Gong, C. Lu, and L. Wang, A learning-based memetic algorithm for energy-efficient flexible job-shop scheduling with type-2 fuzzy processing time, IEEE Trans. Evol. Computat., vol. 27, no. 3, pp. 610–620, 2023.

[32]

B. Xi and D. Lei, Q-learning-based teaching-learning optimization for distributed two-stage hybrid flow shop scheduling with fuzzy processing time, Complex System Modeling and Simulation, vol. 2, no. 2, pp. 113–129, 2022.

[33]

J. N. D. Gupta and S. K. Gupta, Single facility scheduling with nonlinear processing times, Comput. Ind. Eng., vol. 14, no. 4, pp. 387–393, 1988.

[34]

S. Browne and U. Yechiali, Scheduling deteriorating jobs on a single processor, Oper. Res., vol. 38, no. 3, pp. 495–498, 1990.

[35]

Y. Fu, M. Zhou, X. Guo, and L. Qi, Scheduling dual-objective stochastic hybrid flow shop with deteriorating jobs via bi-population evolutionary algorithm, IEEE Trans. Syst. Man Cybern, Syst., vol. 50, no. 12, pp. 5037–5048, 2020.

[36]

T. Jiang, H. Zhu, L. Liu, and Q. Gong, Energy-conscious flexible job shop scheduling problem considering transportation time and deterioration effect simultaneously, Sustain. Comput. Inform. Syst., vol. 35, p. 100680, 2022.

[37]

Y. F. Wang, Adaptive job shop scheduling strategy based on weighted Q-learning algorithm, J. Intell. Manuf., vol. 31, no. 2, pp. 417–432, 2020.

[38]

B. A. Han and J. J. Yang, Research on adaptive job shop scheduling problems based on dueling double DQN, IEEE Access, vol. 8, pp. 186474–186495, 2020.

[39]

L. Wang and Z. Pan, Scheduling optimization for flow-shop based on deep reinforcement learning and iterative greedy method, Control and Decision, vol. 36, no. 11, pp. 2609–2617, 2021.

[40]

L. Wang, X. Hu, Y. Wang, S. Xu, S. Ma, K. Yang, Z. Liu, and W. Wang, Dynamic job-shop scheduling in smart manufacturing using deep reinforcement learning, Comput. Netw., vol. 190, p. 107969, 2021.

[41]
J. J. Wang and L. Wang, A cooperative memetic algorithm with learning-based agent for energy-aware distributed hybrid flow-shop scheduling, IEEE Trans. Evol. Computat., vol. 26, no. 3, pp. 461–475, 2022.
[42]

F. Zhao, S. Di, and L. Wang, A hyperheuristic with Q-learning for the multiobjective energy-efficient distributed blocking flow shop scheduling problem, IEEE Trans. Cybern., vol. 53, no. 5, pp. 3337–3350, 2023.

[43]

F. Zhao, T. Jiang, and L. Wang, A reinforcement learning driven cooperative meta-heuristic algorithm for energy-efficient distributed no-wait flow-shop scheduling with sequence-dependent setup time, IEEE Trans. Ind. Inf., vol. 19, no. 7, pp. 8427–8440, 2023.

[44]

H. Li, K. Gao, P. Y. Duan, J. Q. Li, and L. Zhang, An improved artificial bee colony algorithm with Q-learning for solving permutation flow-shop scheduling problems, IEEE Trans. Syst. Man Cybern, Syst., vol. 53, no. 5, pp. 2684–2693, 2023.

[45]

F. Zhao, G. Zhou, and L. Wang, A cooperative scatter search with reinforcement learning mechanism for the distributed permutation flowshop scheduling problem with sequence-dependent setup times, IEEE Trans. Syst. Man Cybern. Syst., vol. 53, no. 8, pp. 4899–4911, 2023.

[46]

L. A. Zadeh, Fuzzy sets, Inf. Contr., vol. 8, no. 3, pp. 338–353, 1965.

[47]

Q. Zhang and H. Li, MOEA/D: A multiobjective evolutionary algorithm based on decomposition, IEEE Trans. Evol. Computat., vol. 11, no. 6, pp. 712–731, 2007.

[48]

R. Storn and K. Price, Differential evolution—A simple and efficient heuristic for global optimization over continuous spaces, J. Glob. Optim., vol. 11, no. 4, pp. 341–359, 1997.

[49]

R. Liu, J. Li, J. Fan, C. Mu, and L. Jiao, A coevolutionary technique based on multi-swarm particle swarm optimization for dynamic multi-objective optimization, Eur. J. Oper. Res., vol. 261, no. 3, pp. 1028–1051, 2017.

[50]

C. J. C. H. Watkins and P. Dayan, Technical note: Q-learning, Mach. Learn., vol. 8, nos. 3&4, pp. 279–292, 1992.

[51]

K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. Evol. Computat., vol. 6, no. 2, pp. 182–197, 2002.

[52]
K. M. Lee, T. Yamakawa, and K. M. Lee, A genetic algorithm for general machine scheduling problems, in Proc. 1998 2 nd Int. Conf. Knowledge-Based Intelligent Electronic Systems, Proc. KES’98 (Cat. No. 98EX111), Adelaide, Australia, 1998, pp. 60–66.
[53]

P. Brandimarte, Routing and scheduling in a flexible job shop by tabu search, Ann. Oper. Res., vol. 41, no. 3, pp. 157–183, 1993.

[54]

M. Saidi-Mehrabad and P. Fattahi, Flexible job shop scheduling with tabu search algorithms, Int. J. Adv. Manuf. Technol., vol. 32, nos. 5&6, pp. 563–570, 2007.

[55]
D. Behnke and M. J. Geiger, Test instances for the flexible job shop scheduling problem with work centers, https://openhsu.ub.hsu-hh.de/handle/10.24405/436, 2012.
[56]

D. C. Montgomery, R. H. Myers, W. H. Carter, and G. G. Vining, The hierarchy principle in designed industrial experiments, Qual. Reliab. Engng. Int., vol. 21, no. 2, pp. 197–201, 2005.

[57]

L. While, P. Hingston, L. Barone, and S. Huband, A faster algorithm for calculating hypervolume, IEEE Trans. Evol. Computat., vol. 10, no. 1, pp. 29–38, 2006.

[58]

C. A. Coello and N. C. Cortés, Solving multiobjective optimization problems using an artificial immune system, Genet. Program. Evolvable Mach., vol. 6, no. 2, pp. 163–190, 2005.

Complex System Modeling and Simulation
Pages 15-32
Cite this article:
Deng L, Zhu Y, Di Y, et al. Biased Bi-Population Evolutionary Algorithm for Energy-Efficient Fuzzy Flexible Job Shop Scheduling with Deteriorating Jobs. Complex System Modeling and Simulation, 2024, 4(1): 15-32. https://doi.org/10.23919/CSMS.2023.0021

294

Views

22

Downloads

1

Crossref

1

Scopus

Altmetrics

Received: 06 September 2023
Revised: 17 October 2023
Accepted: 29 October 2023
Published: 30 March 2024
© The author(s) 2024.

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).

Return