Skip to main content
Top
Published in: Soft Computing 4/2021

14-10-2020 | Methodologies and Application

A novel multi-objective optimization algorithm for the integrated scheduling of flexible job shops considering preventive maintenance activities and transportation processes

Authors: Hui Wang, Buyun Sheng, Qibing Lu, Xiyan Yin, Feiyu Zhao, Xincheng Lu, Ruiping Luo, Gaocai Fu

Published in: Soft Computing | Issue 4/2021

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Most production scheduling problems, including standard flexible job shop scheduling problems, assume that machines are continuously available. However, in most cases, due to preventive maintenance activities, machines may not be available for a certain time. Meanwhile, in the entire workshop production process, the transportation process of workpieces cannot be ignored. Therefore, the impact of transportation on the production planning should be considered in the scheduling process. To consider both preventive maintenance and transportation processes in the flexible job shop scheduling problem, this paper proposes a flexible job shop scheduling problem considering preventive maintenance activities and transportation processes and establishes a multi-objective flexible job shop scheduling model optimizing the total energy consumption and total makespan. Furthermore, a multi-region division sampling strategy-based multi-objective optimization algorithm integrated with a genetic algorithm and a differential evolution algorithm (MDSS-MOGA-DE) is proposed to solve the model. In the proposed algorithm, a multi-region division sampling strategy and two evaluation functions are utilized to improve the diversity of solutions. In addition, this paper combines a genetic operation and a differential operation to further enhance the search ability of the algorithm. The validity of the algorithm is verified by a real case. The computational results reveal that the proposed model and algorithm obtain appropriate results and have the potential to be applied to other similar problems.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
go back to reference Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener Comput Syst 26(4):533–541CrossRef Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener Comput Syst 26(4):533–541CrossRef
go back to reference Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182–197CrossRef Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182–197CrossRef
go back to reference Fattahi P, Mehrabad MS, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18(3):331–342CrossRef Fattahi P, Mehrabad MS, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18(3):331–342CrossRef
go back to reference Fnaiech N, Fitouri C, Varnier C, Fnaiech F, Zerhouni N (2015) A new heuristic method for solving joint job shop scheduling of production and maintenance. IFAC-Papers OnLine 48(3):1802–1808CrossRef Fnaiech N, Fitouri C, Varnier C, Fnaiech F, Zerhouni N (2015) A new heuristic method for solving joint job shop scheduling of production and maintenance. IFAC-Papers OnLine 48(3):1802–1808CrossRef
go back to reference Gao J, Gen M, Sun L (2006) Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm. J Intell Manuf 17(4):493–507CrossRef Gao J, Gen M, Sun L (2006) Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm. J Intell Manuf 17(4):493–507CrossRef
go back to reference Heger J, Voß T (2018) Dynamic priority based dispatching of AGVs in flexible job shops. Procedia CIRP 79:445–449CrossRef Heger J, Voß T (2018) Dynamic priority based dispatching of AGVs in flexible job shops. Procedia CIRP 79:445–449CrossRef
go back to reference Huang RH, Yu TH (2017) An effective ant colony optimization algorithm for multi-objective job-shop scheduling with equal-size lot-splitting. Appl Soft Comput 57:642–656CrossRef Huang RH, Yu TH (2017) An effective ant colony optimization algorithm for multi-objective job-shop scheduling with equal-size lot-splitting. Appl Soft Comput 57:642–656CrossRef
go back to reference Jamili A (2016) Robust job shop scheduling problem: mathematical models, exact and heuristic algorithms. Expert Syst Appl 55:341–350CrossRef Jamili A (2016) Robust job shop scheduling problem: mathematical models, exact and heuristic algorithms. Expert Syst Appl 55:341–350CrossRef
go back to reference Jiang S, Yang S (2017) A strength pareto evolutionary algorithm based on reference direction for multiobjective and many-objective optimization. IEEE Trans Evolut Comput 21(3):329–346CrossRef Jiang S, Yang S (2017) A strength pareto evolutionary algorithm based on reference direction for multiobjective and many-objective optimization. IEEE Trans Evolut Comput 21(3):329–346CrossRef
go back to reference Kaplanoğlu V (2016) An object-oriented approach for multi-objective flexible job-shop scheduling problem. Expert Syst Appl 45:71–84CrossRef Kaplanoğlu V (2016) An object-oriented approach for multi-objective flexible job-shop scheduling problem. Expert Syst Appl 45:71–84CrossRef
go back to reference Karimi S, Ardalan Z, Naderi B, Mohammadi M (2017) Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm. Appl Math Modell 41:667–682MathSciNetCrossRef Karimi S, Ardalan Z, Naderi B, Mohammadi M (2017) Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm. Appl Math Modell 41:667–682MathSciNetCrossRef
go back to reference Khoukhi FE, Boukachour J, Alaoui AEH (2017) The “Dual-Ants Colony”: a novel hybrid approach for the flexible job shop scheduling problem with preventive maintenance. Comput Ind Eng 106:236–255CrossRef Khoukhi FE, Boukachour J, Alaoui AEH (2017) The “Dual-Ants Colony”: a novel hybrid approach for the flexible job shop scheduling problem with preventive maintenance. Comput Ind Eng 106:236–255CrossRef
go back to reference Li JQ, Pan QK, Tasgetiren MF (2014) A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl Math Modell 38(3):1111–1132MathSciNetCrossRef Li JQ, Pan QK, Tasgetiren MF (2014) A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl Math Modell 38(3):1111–1132MathSciNetCrossRef
go back to reference Li XX, Zhao P, Du BG, Guo J, Xu WX, Zhuang KJ (2017) Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems. Comput Ind Eng 113:10–26CrossRef Li XX, Zhao P, Du BG, Guo J, Xu WX, Zhuang KJ (2017) Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems. Comput Ind Eng 113:10–26CrossRef
go back to reference Luo JP, Liu QQ, Yang Y, Li X, Chen MR, Cao WM (2017) An artificial bee colony algorithm for multi-objective optimisation. Appl Soft Comput 50:235–251CrossRef Luo JP, Liu QQ, Yang Y, Li X, Chen MR, Cao WM (2017) An artificial bee colony algorithm for multi-objective optimisation. Appl Soft Comput 50:235–251CrossRef
go back to reference Maghsoudlou H, Afshar-Nadjafi B, Niaki STA (2017) Multi-skilled project scheduling with level-dependent rework risk; three multi-objective mechanisms based on cuckoo search. Appl Soft Comput 54:46–61CrossRef Maghsoudlou H, Afshar-Nadjafi B, Niaki STA (2017) Multi-skilled project scheduling with level-dependent rework risk; three multi-objective mechanisms based on cuckoo search. Appl Soft Comput 54:46–61CrossRef
go back to reference Manzini R, Accorsi R, Cennerazzo T, Ferrari E, Maranesi F (2015) The scheduling of maintenance. A resource-constraints mixed integer linear programming model. Comput Ind Eng 87:561–568CrossRef Manzini R, Accorsi R, Cennerazzo T, Ferrari E, Maranesi F (2015) The scheduling of maintenance. A resource-constraints mixed integer linear programming model. Comput Ind Eng 87:561–568CrossRef
go back to reference Miyata HH, Nagano MS, Gupta JND (2019) Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Comput Ind Eng 135:79–104CrossRef Miyata HH, Nagano MS, Gupta JND (2019) Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Comput Ind Eng 135:79–104CrossRef
go back to reference Mokhtari H, Dadgar M (2015) Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate. Comput Oper Res 61:31–45MathSciNetCrossRef Mokhtari H, Dadgar M (2015) Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate. Comput Oper Res 61:31–45MathSciNetCrossRef
go back to reference Naderi B, Ghomi SMTF, Aminnayeri M, Zandieh M (2011) Scheduling open shops with parallel machines to minimize total completion time. J Comput Appl Math 235(5):1275–1287MathSciNetCrossRef Naderi B, Ghomi SMTF, Aminnayeri M, Zandieh M (2011) Scheduling open shops with parallel machines to minimize total completion time. J Comput Appl Math 235(5):1275–1287MathSciNetCrossRef
go back to reference Nageswararao M, Narayanarao K, Ranagajanardhana G (2014) Simultaneous scheduling of machines and AGVs in flexible manufacturing system with minimization of tardiness criterion. Proc Mater Sci 5(3):1492–1501CrossRef Nageswararao M, Narayanarao K, Ranagajanardhana G (2014) Simultaneous scheduling of machines and AGVs in flexible manufacturing system with minimization of tardiness criterion. Proc Mater Sci 5(3):1492–1501CrossRef
go back to reference Nouiri M, Bekrar A, Jemai A, Niar S, Ammari AC (2018) An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem. J Intell Manuf 29(3):603–615CrossRef Nouiri M, Bekrar A, Jemai A, Niar S, Ammari AC (2018) An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem. J Intell Manuf 29(3):603–615CrossRef
go back to reference Nouri HE, Driss OB, Ghedira K (2016) Simultaneous scheduling of machines and transport robots in flexible job shop environment using hybrid metaheuristics based on clustered holonic multiagent model. Comput Ind Eng 102:488–501CrossRef Nouri HE, Driss OB, Ghedira K (2016) Simultaneous scheduling of machines and transport robots in flexible job shop environment using hybrid metaheuristics based on clustered holonic multiagent model. Comput Ind Eng 102:488–501CrossRef
go back to reference Ojstersek R, Zhang HK, Liu SF, Buchmeister B (2018) Improved heuristic kalman algorithm for solving multi-objective flexible job shop scheduling problem. Proc Manuf 17:895–902 Ojstersek R, Zhang HK, Liu SF, Buchmeister B (2018) Improved heuristic kalman algorithm for solving multi-objective flexible job shop scheduling problem. Proc Manuf 17:895–902
go back to reference Schutze O, Esquivel X, Lara A, Coello Coello CA (2012) Using the averaged Hausdorff distance as a performance measure in evolutionary multi-objective optimization. IEEE Trans Evolut Comput 16(4):504–522CrossRef Schutze O, Esquivel X, Lara A, Coello Coello CA (2012) Using the averaged Hausdorff distance as a performance measure in evolutionary multi-objective optimization. IEEE Trans Evolut Comput 16(4):504–522CrossRef
go back to reference Sobeyko O, Mönch L (2016) Heuristic approaches for scheduling jobs in large-scale flexible job shops. Comput Oper Res 68:97–109MathSciNetCrossRef Sobeyko O, Mönch L (2016) Heuristic approaches for scheduling jobs in large-scale flexible job shops. Comput Oper Res 68:97–109MathSciNetCrossRef
go back to reference Venske SM, Goncalves RA, Delgado MR (2014) ADEMO/D: multiobjective optimization by an adaptive differential evolution algorithm. Neurocomputing 127:65–77CrossRef Venske SM, Goncalves RA, Delgado MR (2014) ADEMO/D: multiobjective optimization by an adaptive differential evolution algorithm. Neurocomputing 127:65–77CrossRef
go back to reference Wan W, Birch JB (2013) An improved hybrid genetic algorithm with a new local search procedure. J Appl Math 2013:1–10MathSciNet Wan W, Birch JB (2013) An improved hybrid genetic algorithm with a new local search procedure. J Appl Math 2013:1–10MathSciNet
go back to reference Wang SJ, Yu JB (2010) An effective heuristic for flexible job-shop scheduling problem with maintenance activities. Comput Ind Eng 59:436–447CrossRef Wang SJ, Yu JB (2010) An effective heuristic for flexible job-shop scheduling problem with maintenance activities. Comput Ind Eng 59:436–447CrossRef
go back to reference Wu XL, Shen XL, Li CB (2019) The flexible job-shop scheduling problem considering deterioration effect and energy consumption simultaneously. Comput Ind Eng 135:1004–1024CrossRef Wu XL, Shen XL, Li CB (2019) The flexible job-shop scheduling problem considering deterioration effect and energy consumption simultaneously. Comput Ind Eng 135:1004–1024CrossRef
go back to reference Xiang Y, Zhou Y, Li M, Chen Z (2017) A vector angle-based evolutionary algorithm for unconstrained many-objective optimization. IEEE Trans Evolut Comput 21(1):131–152CrossRef Xiang Y, Zhou Y, Li M, Chen Z (2017) A vector angle-based evolutionary algorithm for unconstrained many-objective optimization. IEEE Trans Evolut Comput 21(1):131–152CrossRef
go back to reference Xiao L, Song SL, Chen XH, Coit DW (2016) Joint optimization of production scheduling and machine group preventive maintenance. Reliab Eng Syst Saf 146:68–78CrossRef Xiao L, Song SL, Chen XH, Coit DW (2016) Joint optimization of production scheduling and machine group preventive maintenance. Reliab Eng Syst Saf 146:68–78CrossRef
go back to reference Xie J, Gao L, Pan QK, Tasgetiren MF (2019) An effective multi-objective artificial bee colony algorithm for energy efficient distributed job shop scheduling. Proc Manuf 39:1194–1203 Xie J, Gao L, Pan QK, Tasgetiren MF (2019) An effective multi-objective artificial bee colony algorithm for energy efficient distributed job shop scheduling. Proc Manuf 39:1194–1203
go back to reference Zandieh M, Khatami AR, Rahmati SHA (2017) Flexible job shop scheduling under condition-based maintenance: improved version of imperialist competitive algorithm. Appl Soft Comput 58:449–464CrossRef Zandieh M, Khatami AR, Rahmati SHA (2017) Flexible job shop scheduling under condition-based maintenance: improved version of imperialist competitive algorithm. Appl Soft Comput 58:449–464CrossRef
go back to reference Zhang WQ, Xu W, Gen M (2013) Multi-objective evolutionary algorithm with strong convergence of multi-area for assembly line balancing problem with worker capability. Proc Comput Sci 20:83–89CrossRef Zhang WQ, Xu W, Gen M (2013) Multi-objective evolutionary algorithm with strong convergence of multi-area for assembly line balancing problem with worker capability. Proc Comput Sci 20:83–89CrossRef
go back to reference Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evolut Comput 3(4):257–271CrossRef Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evolut Comput 3(4):257–271CrossRef
Metadata
Title
A novel multi-objective optimization algorithm for the integrated scheduling of flexible job shops considering preventive maintenance activities and transportation processes
Authors
Hui Wang
Buyun Sheng
Qibing Lu
Xiyan Yin
Feiyu Zhao
Xincheng Lu
Ruiping Luo
Gaocai Fu
Publication date
14-10-2020
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 4/2021
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-020-05347-z

Other articles of this Issue 4/2021

Soft Computing 4/2021 Go to the issue

Premium Partner