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

22-02-2015 | Methodologies and Application

Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization

Authors: Du-Juan Wang, Feng Liu, Jian-Jun Wang, Yan-Zhang Wang

Published in: Soft Computing | Issue 4/2016

Log in

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

search-config
loading …

Abstract

In this paper, we study a rescheduling problem in response to arrival of new jobs in single machine layout, where preventive maintenance should be determined. Preventive maintenance together with controllable processing time could alleviate the inherent deteriorating effect in manufacturing system. Processing sequence of original and new jobs, compression of each job, and position of maintenance should be optimized simultaneously with regards to total operational cost (job’s total completion times, maintenance cost and compression cost) and total completion time deviation. An improved elitist non-dominated sorting genetic algorithm (NSGA-II) has been proposed to solve the rescheduling problem. To address the key problem of balancing between exploration and exploitation, we hybridize differential evolution mutation operation with NSGA-II to enhance diversity, constitute high-quality initial solution based on assignment model for exploitation, and incorporate analytic property of non-dominated solutions for exploration. Finally computational study is designed by randomly generating various instances with regards to the problem size from given distributions. By use of existing performance indicators for convergence and diversity of Pareto fronts, we illustrate the effectiveness of the hybrid algorithm and the incorporation of domain knowledge into evolutionary optimization in rescheduling.

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!

Appendix
Available only for authorised users
Literature
go back to reference Aytug H, Lawley MA, McKay K, Mohan S, Uzsoy R (2005) Executing production schedules in the face of uncertainties: a review and some future directions. Eur J Oper Res 161:86–110MathSciNetMATHCrossRef Aytug H, Lawley MA, McKay K, Mohan S, Uzsoy R (2005) Executing production schedules in the face of uncertainties: a review and some future directions. Eur J Oper Res 161:86–110MathSciNetMATHCrossRef
go back to reference Bandyopadhyay S, Bhattacharya R (2013) Solving multi-objective parallel machine scheduling problem by a modified NSGA-II. Appl Math Model 37:6718–6729MathSciNetCrossRef Bandyopadhyay S, Bhattacharya R (2013) Solving multi-objective parallel machine scheduling problem by a modified NSGA-II. Appl Math Model 37:6718–6729MathSciNetCrossRef
go back to reference Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35:268–308CrossRef Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35:268–308CrossRef
go back to reference Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495–498MATHCrossRef Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495–498MATHCrossRef
go back to reference Chiu YF, Shih CJ (2012) Rescheduling strategies for integrating rush orders with preventive maintenance in a two-machine flow shop. Int J Prod Res 50:5783–5794CrossRef Chiu YF, Shih CJ (2012) Rescheduling strategies for integrating rush orders with preventive maintenance in a two-machine flow shop. Int J Prod Res 50:5783–5794CrossRef
go back to reference Ćrepinšek M, Liu S, Mernik M (2013) Exploration and exploitation in evolutionary algorithms. ACM Comput Surv 45:1–33MATH Ćrepinšek M, Liu S, Mernik M (2013) Exploration and exploitation in evolutionary algorithms. ACM Comput Surv 45:1–33MATH
go back to reference Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE T Evolut Comput 15:4–31CrossRef Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE T Evolut Comput 15:4–31CrossRef
go back to reference Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE T Evolut Comput 6:182–197CrossRef Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE T Evolut Comput 6:182–197CrossRef
go back to reference Dong MG, Wang N (2012) A novel hybrid differential evolution approach to scheduling of large-scale zero-wait batch processes with setup times. Comput Chem Eng 45:72–83MathSciNetCrossRef Dong MG, Wang N (2012) A novel hybrid differential evolution approach to scheduling of large-scale zero-wait batch processes with setup times. Comput Chem Eng 45:72–83MathSciNetCrossRef
go back to reference Gogna A, Tayal A (2013) Metaheuristics: review and application. J Exp Theor Artif In 25:503–526CrossRef Gogna A, Tayal A (2013) Metaheuristics: review and application. J Exp Theor Artif In 25:503–526CrossRef
go back to reference Gopalakrishnan M, Ahire SL, Miller DM (1997) Maximizing the effectiveness of a preventive maintenance system: an adaptive modeling approach. Manage Sci 43:827–840MATHCrossRef Gopalakrishnan M, Ahire SL, Miller DM (1997) Maximizing the effectiveness of a preventive maintenance system: an adaptive modeling approach. Manage Sci 43:827–840MATHCrossRef
go back to reference Gordon VS, Potts CN, Strusevich VA, Whitehead JD (2008) Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. J Sched 11:357–370MathSciNetMATHCrossRef Gordon VS, Potts CN, Strusevich VA, Whitehead JD (2008) Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. J Sched 11:357–370MathSciNetMATHCrossRef
go back to reference Gu FQ, Liu HL, Tan KC (2014) A hybrid evolutionary multiobjective optimization algorithm with adaptive multi-fitness assignment. Soft Comput (Accepted) Gu FQ, Liu HL, Tan KC (2014) A hybrid evolutionary multiobjective optimization algorithm with adaptive multi-fitness assignment. Soft Comput (Accepted)
go back to reference Gunasekaran A (1998) Agile manufacturing: enablers and an implementation framework. Int J Prod Res 36:1223–1247MATHCrossRef Gunasekaran A (1998) Agile manufacturing: enablers and an implementation framework. Int J Prod Res 36:1223–1247MATHCrossRef
go back to reference Han Y, Gong D, Sun X, Pan Q (2014) An improved NSGA-II algorithm for multi-objective lot-streaming flow shop scheduling problem. Int J Prod Res 52:2211–2231CrossRef Han Y, Gong D, Sun X, Pan Q (2014) An improved NSGA-II algorithm for multi-objective lot-streaming flow shop scheduling problem. Int J Prod Res 52:2211–2231CrossRef
go back to reference He Y, Sun L (2015) One-machine scheduling problems with deteriorating jobs and position dependent learning effects under group technology considerations. Int J Syst Sci 46:1319–1326MathSciNetMATHCrossRef He Y, Sun L (2015) One-machine scheduling problems with deteriorating jobs and position dependent learning effects under group technology considerations. Int J Syst Sci 46:1319–1326MathSciNetMATHCrossRef
go back to reference Helo P (2004) Managing agility and productivity in the electronics industry. Ind Manage Data Syst 104:567–577CrossRef Helo P (2004) Managing agility and productivity in the electronics industry. Ind Manage Data Syst 104:567–577CrossRef
go back to reference Hoogeveen H, Lente C, T’Kindt V (2012) Rescheduling for new orders on a single machine with setup times. Eur J Oper Res 223:40–46MathSciNetMATHCrossRef Hoogeveen H, Lente C, T’Kindt V (2012) Rescheduling for new orders on a single machine with setup times. Eur J Oper Res 223:40–46MathSciNetMATHCrossRef
go back to reference Jaszkiewicz A (2003) Do multiple-objective metaheuristcs deliver on their promises? A computational experiment on the set-covering problem. IEEE T Evol Comput 7(2):133–143MathSciNetCrossRef Jaszkiewicz A (2003) Do multiple-objective metaheuristcs deliver on their promises? A computational experiment on the set-covering problem. IEEE T Evol Comput 7(2):133–143MathSciNetCrossRef
go back to reference Jin Y, Branke J (2005) Evolutionary optimization in uncertain environments-A survey. IEEE T Evol Comput 9(3):303–317CrossRef Jin Y, Branke J (2005) Evolutionary optimization in uncertain environments-A survey. IEEE T Evol Comput 9(3):303–317CrossRef
go back to reference Kubzin MA, Strusevich VA (2006) Planning machine maintenance in two-machine shop scheduling. Oper Res 54:789–800MATHCrossRef Kubzin MA, Strusevich VA (2006) Planning machine maintenance in two-machine shop scheduling. Oper Res 54:789–800MATHCrossRef
go back to reference Lee CY, Lin CS (2001) Single-machine scheduling with maintenance and repair rate-modifying activities. Eur J Oper Res 135:493–513MathSciNetMATHCrossRef Lee CY, Lin CS (2001) Single-machine scheduling with maintenance and repair rate-modifying activities. Eur J Oper Res 135:493–513MathSciNetMATHCrossRef
go back to reference Li B, Wang L (2007) A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling. IEEE T Syst Man Cy B 37:576–591CrossRef Li B, Wang L (2007) A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling. IEEE T Syst Man Cy B 37:576–591CrossRef
go back to reference Liu F, Wang JJ, Yang DL (2013) Solving single machine scheduling under disruption with discounted costs by quantum-inspired hybrid heuristics. J Manuf Syst 32:715–723CrossRef Liu F, Wang JJ, Yang DL (2013) Solving single machine scheduling under disruption with discounted costs by quantum-inspired hybrid heuristics. J Manuf Syst 32:715–723CrossRef
go back to reference Ma Y, Chu C, Zuo C (2010) A survey of scheduling with deterministic machine availability constraints. Comput Ind Eng 58:199–211CrossRef Ma Y, Chu C, Zuo C (2010) A survey of scheduling with deterministic machine availability constraints. Comput Ind Eng 58:199–211CrossRef
go back to reference Mosheiov G, Sarig A (2009) Scheduling a maintenance activity and due-window assignment on a single machine. Comput Oper Res 36:2541–2545MathSciNetMATHCrossRef Mosheiov G, Sarig A (2009) Scheduling a maintenance activity and due-window assignment on a single machine. Comput Oper Res 36:2541–2545MathSciNetMATHCrossRef
go back to reference Mosheiov G, Sidney JB (2010) Scheduling a deteriorating maintenance activity on a single machine. J Oper Res Soc 61:882–887MATHCrossRef Mosheiov G, Sidney JB (2010) Scheduling a deteriorating maintenance activity on a single machine. J Oper Res Soc 61:882–887MATHCrossRef
go back to reference Nguyen S, Zhang M, Johnston M, Tan KC (2014b) Automatic programming via iterated local search for dynamic job shop scheduling. IEEE T Cy, Accepted Nguyen S, Zhang M, Johnston M, Tan KC (2014b) Automatic programming via iterated local search for dynamic job shop scheduling. IEEE T Cy, Accepted
go back to reference Nguyen S, Zhang M, Johnston M, Tan KC (2014) Automatic design of scheduling policies for dynamic multi-objective job shop scheduling via cooperative coevolution genetic programming. IEEE T Evol Comput 18(2):193–208CrossRef Nguyen S, Zhang M, Johnston M, Tan KC (2014) Automatic design of scheduling policies for dynamic multi-objective job shop scheduling via cooperative coevolution genetic programming. IEEE T Evol Comput 18(2):193–208CrossRef
go back to reference Nguyen S, Zhang M, Johnston M, Tan KC (2014) Genetic programming for evolving reusable due-date assignment models in job shop environment. Evol Comput 22(1):105–138 Nguyen S, Zhang M, Johnston M, Tan KC (2014) Genetic programming for evolving reusable due-date assignment models in job shop environment. Evol Comput 22(1):105–138
go back to reference Oron D (2014) Scheduling controllable processing time jobs in a deteriorating environment. J Oper Res Soc 65:49–56 Oron D (2014) Scheduling controllable processing time jobs in a deteriorating environment. J Oper Res Soc 65:49–56
go back to reference Paenke I, Branke J, Jin Y (2006) Efficient search for robust solutions by means of evolutionary algorithms and fitness approximation. IEEE T Evolut Comput 10(4):405–420CrossRef Paenke I, Branke J, Jin Y (2006) Efficient search for robust solutions by means of evolutionary algorithms and fitness approximation. IEEE T Evolut Comput 10(4):405–420CrossRef
go back to reference Pan Q, Wang L, Gao L, Li WD (2011) An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers. Inform Sci 181:668–685CrossRef Pan Q, Wang L, Gao L, Li WD (2011) An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers. Inform Sci 181:668–685CrossRef
go back to reference Rustogi K, Strusevich VA (2012) Single machine scheduling with general positional deterioration and rate-modifying maintenance. Omega 40:791–804CrossRef Rustogi K, Strusevich VA (2012) Single machine scheduling with general positional deterioration and rate-modifying maintenance. Omega 40:791–804CrossRef
go back to reference Storn R, Kenneth P (1997) Differential evolution: a simple and efficient heuristic for global optimization over continuous Spaces. J Global Optim 11:341–359MathSciNetMATHCrossRef Storn R, Kenneth P (1997) Differential evolution: a simple and efficient heuristic for global optimization over continuous Spaces. J Global Optim 11:341–359MathSciNetMATHCrossRef
go back to reference Tasgetiren MF, Pan Q, Suganthan PN, Jin Chua T (2011) A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion. Int J Prod Res 49:5033–5050 Tasgetiren MF, Pan Q, Suganthan PN, Jin Chua T (2011) A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion. Int J Prod Res 49:5033–5050
go back to reference Tepedino ACMA, Takahashi RHC, Carrano EG (2013) Distance based NSGA-II for earliness and tardiness minimization in parallel machine scheduling. IEEE Congr Evol Comput, pp 317–324 Tepedino ACMA, Takahashi RHC, Carrano EG (2013) Distance based NSGA-II for earliness and tardiness minimization in parallel machine scheduling. IEEE Congr Evol Comput, pp 317–324
go back to reference Ulungu EL, Teghem J, Ost C (1998) Efficiency of interactive multiobjective simulated annealing through a case study. J Oper Res Soc 49(10):1044–1050MATHCrossRef Ulungu EL, Teghem J, Ost C (1998) Efficiency of interactive multiobjective simulated annealing through a case study. J Oper Res Soc 49(10):1044–1050MATHCrossRef
go back to reference Van Veldhuizen DA (1999) Multiobjective evolutionary algorithms: classifications, analyses, and new innovations, Ph.D. dissertation, Dept Elect Comput Eng, Graduate School Eng, Air Force Inst Technol, Wright-Patterson AFB, OH Van Veldhuizen DA (1999) Multiobjective evolutionary algorithms: classifications, analyses, and new innovations, Ph.D. dissertation, Dept Elect Comput Eng, Graduate School Eng, Air Force Inst Technol, Wright-Patterson AFB, OH
go back to reference Vieira GE, Herrmann JW, Lin E (2003) Rescheduling manufacturing systems: a framework of strategies, policies, and methods. J Scheduling 6:39–62MathSciNetMATHCrossRef Vieira GE, Herrmann JW, Lin E (2003) Rescheduling manufacturing systems: a framework of strategies, policies, and methods. J Scheduling 6:39–62MathSciNetMATHCrossRef
go back to reference Wang Y, Cai ZX (2012) Combining multiobjective optimization with differential evolution to solve constrained optimization problems. IEEE Trans Evolut Comput 16:117–134 Wang Y, Cai ZX (2012) Combining multiobjective optimization with differential evolution to solve constrained optimization problems. IEEE Trans Evolut Comput 16:117–134
go back to reference Wang L, Pan Q, Suganthan PN, Wang W, Wang Y (2010) A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Comput Oper Res 37:509–520MathSciNetMATHCrossRef Wang L, Pan Q, Suganthan PN, Wang W, Wang Y (2010) A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Comput Oper Res 37:509–520MathSciNetMATHCrossRef
go back to reference Wang J, Wang C (2011) Single-machine due-window assignment problem with learning effect and deteriorating jobs. Appl Math Model 35:4017–4022MathSciNetMATHCrossRef Wang J, Wang C (2011) Single-machine due-window assignment problem with learning effect and deteriorating jobs. Appl Math Model 35:4017–4022MathSciNetMATHCrossRef
go back to reference Wang JJ, Wang JB, Liu F (2011) Parallel machines scheduling with a deteriorating maintenance activity. J Oper Res Soc 62:1898–1902 Wang JJ, Wang JB, Liu F (2011) Parallel machines scheduling with a deteriorating maintenance activity. J Oper Res Soc 62:1898–1902
go back to reference Yang S, Yang D (2010) Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities. Omega 38:528–533CrossRef Yang S, Yang D (2010) Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities. Omega 38:528–533CrossRef
go back to reference Yang S, Yang D, Cheng TCE (2010) Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance. Comput Oper Res 37:1510–1514MathSciNetMATHCrossRef Yang S, Yang D, Cheng TCE (2010) Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance. Comput Oper Res 37:1510–1514MathSciNetMATHCrossRef
go back to reference Yin Y, Wu W, Cheng TCE, Wu C (2014c) Due date assignment and single-machine scheduling with generalized positional deteriorating jobs and deteriorating multi-maintenance activities. Int J Prod Res 52:2311–2326CrossRef Yin Y, Wu W, Cheng TCE, Wu C (2014c) Due date assignment and single-machine scheduling with generalized positional deteriorating jobs and deteriorating multi-maintenance activities. Int J Prod Res 52:2311–2326CrossRef
go back to reference Yin Y, Cheng TCE, Wu C, Cheng S (2014d) Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity. Int J Prod Res 52:5583–5596CrossRef Yin Y, Cheng TCE, Wu C, Cheng S (2014d) Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity. Int J Prod Res 52:5583–5596CrossRef
go back to reference Yin Y, Cheng TCE, Wu C (2014a) Scheduling with time dependent processing times. Math Probl Eng, pp 1–2 Yin Y, Cheng TCE, Wu C (2014a) Scheduling with time dependent processing times. Math Probl Eng, pp 1–2
go back to reference Zhao C, Tang H (2010) Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan. Appl Math Model 34:837–841MathSciNetMATHCrossRef Zhao C, Tang H (2010) Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan. Appl Math Model 34:837–841MathSciNetMATHCrossRef
go back to reference Zhao CL, Tang HY (2010) Rescheduling problems with deteriorating jobs under disruptions. Appl Math Model 34:238–243 Zhao CL, Tang HY (2010) Rescheduling problems with deteriorating jobs under disruptions. Appl Math Model 34:238–243
go back to reference Zhou A, Jin Y, Zhang Q (2014) A population prediction strategy for evolutionary dynamic multiobjective optimization. IEEE T Cy 44(1):40–53 Zhou A, Jin Y, Zhang Q (2014) A population prediction strategy for evolutionary dynamic multiobjective optimization. IEEE T Cy 44(1):40–53
go back to reference Zitzler E (1999) Evolutionary algorithms for multiobjective optimization: methods and applications, Ph.D. dissertation, Swiss Fed Inst Technol (ETH), Zurich, Switzerland Zitzler E (1999) Evolutionary algorithms for multiobjective optimization: methods and applications, Ph.D. dissertation, Swiss Fed Inst Technol (ETH), Zurich, Switzerland
Metadata
Title
Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization
Authors
Du-Juan Wang
Feng Liu
Jian-Jun Wang
Yan-Zhang Wang
Publication date
22-02-2015
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 4/2016
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-015-1615-7

Other articles of this Issue 4/2016

Soft Computing 4/2016 Go to the issue

Methodologies and Application

Tree index of uncertain graphs

Premium Partner