Multiobjective approach for deteriorating jobs scheduling for a sustainable manufacturing system

  • Meriem Tigane
  • Mohammed DahaneEmail author
  • Mourad Boudhar


With ever-increasing concerns about climate change, and in the context of diminishing fossil energy resources, energy consumption has become a subject of great importance. In this framework, our study is concerned with the reduction of the energy consumed by a manufacturing system composed of several unrelated parallel machines. We investigate the problem of scheduling a set of n deteriorating jobs on m parallel unrelated machines subject to a deterioration effect, where the processing time of each job is a linear deterioration function of the starting time. The objective is to determine the best scheduling of the jobs, minimizing the makespan and the total energy consumption. We implement a nondominated sorting-based multiobjective algorithm (NSGA-II)-based approaches with a given scheduling rules to solve the developed mathematical model of the considered problem. The performance of the proposed approaches are compared with an exact algorithm and evaluated through computational experiments. Then, we give a multiobjective decision-making method based on the TOPSIS (technique for order of preference by similarity to ideal solution) technique to determine the best solution from the Pareto front according to the decision-maker’s preferences.


Deteriorating jobs Scheduling Parallel machines Energy consumption Makespan NSGA-II 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.



  1. 1.
    Afzalirad M, Rezaeian J (2016) Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions. Comput Ind Eng 98:40–52CrossRefGoogle Scholar
  2. 2.
    Arnaout JP, Musa R, Rabadi G, 2014 A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines-part ii: enhancements and experimentations. Journal of Intelligent ManufacturingGoogle Scholar
  3. 3.
    Avalos-Rosales O, Angel-Bello F, Alvarez A (2015) Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. Int J Adv Manuf Technol 76:1705–1718CrossRefGoogle Scholar
  4. 4.
    Bachman A, Janiak A (2004) Scheduling jobs with position-dependent processing times. J Oper Res Soc 55(3):257–264zbMATHCrossRefGoogle Scholar
  5. 5.
    Bahalke U, Yolmeh A, Shahanaghi K (2010) Meta-heuristics to solve single-machine scheduling problem with sequence-dependent setup time and deteriorating jobs. Int J Adv Manuf Technol 50(5):749–759CrossRefGoogle Scholar
  6. 6.
    Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38(3):495–498zbMATHCrossRefGoogle Scholar
  7. 7.
    Cappadonna F, Costa A, Fichera S (2013) Makespan minimization of unrelated parallel machines with limited human resources. Procedia CIRP 12:450–455CrossRefGoogle Scholar
  8. 8.
    Chang P, Chen S (2011) Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times. Appl Soft Comput 11(1):1263–1274CrossRefGoogle Scholar
  9. 9.
    Charalambous C, Fleszar K (2012) Variable neighborhood descent for the unrelated parallel machine scheduling problem. Int J Artif Intell Tools 21(04):1240, 019CrossRefGoogle Scholar
  10. 10.
    Che A, Zhang S, Wu X (2017) Energy-conscious unrelated parallel machine scheduling under time-of-use electricity tariffs. J Clean Prod 156:688–697CrossRefGoogle Scholar
  11. 11.
    Chen JF (2005) Unrelated parallel machine scheduling with secondary resource constraints. Int J Adv Manuf Technol 26(3):285–292Google Scholar
  12. 12.
    Chen ZL (1996) Parallel machine scheduling with time dependent processing times. Discret Appl Math 70 (1):81–93MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Cheng J, Chu F, Zhou M (2017) An improved model for parallel machine scheduling under time-of-use electricity price. IEEE Trans Autom Sci Eng PP(99):1–4Google Scholar
  14. 14.
    Cheng T, Ding Q (1998) The complexity of single machine scheduling with release time. Information Processing LettersGoogle Scholar
  15. 15.
    Cheng T, Ding Q (2000) Single machine scheduling with deadlines and increasing rates of processing times. Acta InformaticaGoogle Scholar
  16. 16.
    Costa A, Cappadonna FA, Fichera S (2013) A hybrid genetic algorithm for job sequencing and worker allocation in parallel unrelated machines with sequence-dependent setup times. Int J Adv Manuf Technol 69 (9–12):2799–2817CrossRefGoogle Scholar
  17. 17.
    Damodaran P, Diyadawagamage D, Ghrayeb O, Vélez-Gallego MC (2012) A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines. The International Journal of Advanced Manufacturing TechnologyGoogle Scholar
  18. 18.
    Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans Evol Comput 6(2):182–197CrossRefGoogle Scholar
  19. 19.
    Ding JY, Song S, Zhang R, Chiong R, Wu C (2016) Parallel machine scheduling under time-of-use electricity prices: new models and optimization approaches. IEEE Trans Autom Sci Eng 13(2):1138–1154CrossRefGoogle Scholar
  20. 20.
    Ebrahimi E, Rezaeian J (2015) Unrelated parallel machines scheduling with the effect of aging and learning under multi maintenance activities. Manufacturing Science and TechnologyGoogle Scholar
  21. 21.
    Eroglu DY, Ozmutlu HC, Ozmutlu S (2014) Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times. Int J Prod Res 52(19):5841–5856CrossRefGoogle Scholar
  22. 22.
    Ezugwu AE, Adeleke OJ, Viriri S (2018) Symbiotic organisms search algorithm for the unrelated parallel machines scheduling with sequence-dependent setup times. PLOS ONE 13(7):1–23CrossRefGoogle Scholar
  23. 23.
    Fanjul-Peyro L, Ruiz R (2010) Iterated greedy local search methods for unrelated parallel machine scheduling. Eur J Oper Res 207(1):55–69MathSciNetzbMATHCrossRefGoogle Scholar
  24. 24.
    Fanjul-Peyro L, Ruiz R (2012) Scheduling unrelated parallel machines with optional machines and jobs selection. Comput Oper Res 39(7):1745–1753MathSciNetzbMATHCrossRefGoogle Scholar
  25. 25.
    Ferrer S, Nicolò G, Salido MA, Giret A, Barber F (2018) Dynamic rescheduling in energy-aware unrelated parallel machine problems. In: Proceedings of the 13th Workshop on Constraint Satisfaction Techniques for Planning and Scheduling, pp 73–81Google Scholar
  26. 26.
    Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Co., New YorkzbMATHGoogle Scholar
  27. 27.
    Gawiejnowicz S (2007) Scheduling deteriorating jobs subject to job or machine availability constraints. Eur J Oper Res 180(1):472–478zbMATHCrossRefGoogle Scholar
  28. 28.
    Gawiejnowicz S, Pankowska L (1995) Scheduling jobs with varying processing times. Inf Process Lett 54 (3):175–178zbMATHCrossRefGoogle Scholar
  29. 29.
    Ghirardi M, Potts C (2005) Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach. Eur J Oper Res 165(2):457–467zbMATHCrossRefGoogle Scholar
  30. 30.
    Glass C, Potts C, Shade P (1994) Unrelated parallel machine scheduling using local search. Math Comput Modell 20(2):41–52zbMATHCrossRefGoogle Scholar
  31. 31.
    Graham R, Lawler E, Lenstra J, Kan A (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287–326MathSciNetzbMATHCrossRefGoogle Scholar
  32. 32.
    Guo Y, Lim A, Rodrigues B, Yang L (2007) Minimizing the makespan for unrelated parallel machines. Int J Artif Intell Tools 16(03):399–415CrossRefGoogle Scholar
  33. 33.
    Gupta JND, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Ind Eng 14(4):387–393CrossRefGoogle Scholar
  34. 34.
    Hariri AMA, Potts CN (1991) Heuristics for scheduling unrelated parallel machines. Comput Oper Res 18 (3):323–331zbMATHCrossRefGoogle Scholar
  35. 35.
    Hsieh YC, Bricker D (1997) Scheduling linearly deteriorating jobs on multiple machines. Comput Ind Eng 32(4):727–734CrossRefGoogle Scholar
  36. 36.
    Hsu CJ, Ji M, Guo JY, Yang DL (2013) Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activity. Inf Sci 253:163–169zbMATHCrossRefGoogle Scholar
  37. 37.
    Hsu LC (2009) Some identities involving three kinds of counting numbers. ArXivGoogle Scholar
  38. 38.
    International Energy Agency I (2016) Key world energy statistics 2016Google Scholar
  39. 39.
    International Renewable Energy Agency I (2016) Renewable capacity statistics 2016Google Scholar
  40. 40.
    Ji M, Cheng T (2009) Parallel-machine scheduling of simple linear deteriorating jobs. Theor Comput Sci 410(38):3761–3768MathSciNetzbMATHCrossRefGoogle Scholar
  41. 41.
    Ji M, He Y, Cheng T (2006) Scheduling linear deteriorating jobs with an availability constraint on a single machine. Theor Comput Sci 362(1):115–126MathSciNetzbMATHCrossRefGoogle Scholar
  42. 42.
    Jia Z, lan Zhang Y, Leung JYT, Li K (2017) Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines. Appl Soft Comput 55:226–237CrossRefGoogle Scholar
  43. 43.
    Jin J, Ji P (2017) Scheduling jobs with resource-dependent ready times and processing times depending on their starting times and positions. The Computer JournalGoogle Scholar
  44. 44.
    Kang L, Ng C (2007) A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs. Int J Prod Econ 109(1):180–184CrossRefGoogle Scholar
  45. 45.
    Kant G, Sangwan K (2015) Predictive modeling for power consumption in machining using artificial intelligence techniques. Procedia CIRP 26:403–407CrossRefGoogle Scholar
  46. 46.
    Kumar KS, Selladurai V, Raja K, Elangovan K (2011) Ant colony approach for makespan minimization on unrelated parallel machines. International Journal of Engineering Science and Technology:3Google Scholar
  47. 47.
    Kuo W, Yang D (2008) Parallel-machine scheduling with time dependent processing times. Theor Comput Sci 393(1):204–210MathSciNetzbMATHCrossRefGoogle Scholar
  48. 48.
    Lee W, Wu C (2003) Scheduling linear deterioration jobs to minimize makespan with an availability constraint on a single machine. Inf Process Lett 87:89–93zbMATHCrossRefGoogle Scholar
  49. 49.
    Lee W, Wu C (2008) Multi-machine scheduling with deteriorating jobs and scheduled maintenance. Appl Math Modell 32(3):362–373MathSciNetzbMATHCrossRefGoogle Scholar
  50. 50.
    Lenstra J, Shmoys D, Tardos E (1990) Approximation algorithms for scheduling unrelated parallel machines. Mathematical ProgrammingGoogle Scholar
  51. 51.
    Li K, Liu C, Li K (2014) An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs. Theor Comput Sci 543:46–51MathSciNetzbMATHCrossRefGoogle Scholar
  52. 52.
    Li W, Zein A, Kara S, Herrmann C (2011) An investigation into fixed energy consumption of machine tools, Springer, chap Glocalized Solutions for Sustainability in Manufacturing, pp 268–273Google Scholar
  53. 53.
    Li Z, Yang H, Zhang s, Liu G (2016) Unrelated parallel machine scheduling problem with energy and tardiness cost. The International Journal of Advanced Manufacturing TechnologyGoogle Scholar
  54. 54.
    Lin Y, Pfund M, Fowler J (2011) Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems. Comput Oper Res 38(6):901–916MathSciNetzbMATHCrossRefGoogle Scholar
  55. 55.
    Liu C, Huang D (2014) Reduction of power consumption and carbon footprints by applying multi-objective optimisation via genetic algorithms. Int J Prod Res 52(2):337–352CrossRefGoogle Scholar
  56. 56.
    Mazdeh MM, Zaerpour F, Zareei A, Hajinezhad A (2010) Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs. Appl Math Model 34(6):1498–1510MathSciNetzbMATHCrossRefGoogle Scholar
  57. 57.
    Miao C, Zhang Y, Cao Z (2011) Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs. Inf Process Lett 111(16):798–803MathSciNetzbMATHCrossRefGoogle Scholar
  58. 58.
    Moon J, Shin K, Park J (2013) Optimization of production scheduling with time-dependent and machine-dependent electricity cost for industrial energy efficiency. The International Journal of Advanced Manufacturing TechnologyGoogle Scholar
  59. 59.
    Mosheiov G (1991) V-shaped policies for scheduling deteriorating jobs. Oper Res 39(6):979–991MathSciNetzbMATHCrossRefGoogle Scholar
  60. 60.
    Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21(6):653–659zbMATHCrossRefGoogle Scholar
  61. 61.
    Mosheiov G (1995) Scheduling jobs with step-deterioration; minimizing makespan on a single and multi-machine. Comput Ind Eng 28(4):869–879MathSciNetCrossRefGoogle Scholar
  62. 62.
    Mosheiov G (1998) Multi-machine scheduling with linear deterioration. INFOR: Inf Syst Oper Res 36(4):205–214Google Scholar
  63. 63.
    Mouzon G (2008) Operational methods and models for minimization of energy consumption in manufacturing environment. PhD thesis, Wichita State UniversityGoogle Scholar
  64. 64.
    Neto RT, Filho MG (2013) Literature review regarding ant colony optimization applied to scheduling problems: guidelines for implementation and directions for future research. Eng Appl Artif Intell 26(1):150–161CrossRefGoogle Scholar
  65. 65.
    Nicolo G, Salido M, Ferrer S, AGiret BF (2017) A multi-agent approach using dynamic constraints to solve energy-aware unrelated parallel machine scheduling problem with energy-dependent and sequence-dependent setup time. In: COPLAS’2017, pp 31–37Google Scholar
  66. 66.
    Nikabadi M, Naderi R (2016) A hybrid algorithm for unrelated parallel machines scheduling. International Journal of Industrial Engineering ComputationsGoogle Scholar
  67. 67.
    de Paula MR, Ravetti MG, Mateus GR, Pardalos PM (2007) Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search. IMA J Manag Math 18(2):101–115MathSciNetzbMATHCrossRefGoogle Scholar
  68. 68.
    Pechmann A, Schöler I (2011) Optimizing energy costs by intelligent production scheduling, Springer, Berlin, chap Glocalized Solutions for Sustainability in Manufacturing, pp 293–298Google Scholar
  69. 69.
    Rabadi G, Moraga R, Al-Salem A (2006) Heuristics for the unrelated parallel machine scheduling problem with setup times. J Intell Manuf 17(1):85–97CrossRefGoogle Scholar
  70. 70.
    Ren CR, Kang LY (2007) An approximation algorithm for parallel machine scheduling with simple linear deterioration. J Shanghai Univ 11(4):351–354MathSciNetzbMATHCrossRefGoogle Scholar
  71. 71.
    Shchepin EV, Vakhania N (2005) An optimal rounding gives a better approximation for scheduling unrelated machines. Oper Res Lett 33(2):127–133MathSciNetzbMATHCrossRefGoogle Scholar
  72. 72.
    Shu LF, He Y, Hu T (2012) An on-line approach for energy efficiency monitoring of machine tools. J Clean Prod 27:133–140CrossRefGoogle Scholar
  73. 73.
    Talbi EG (2009) Metaheuristics: from design to implementation, vol 74. Wiley, New YorkzbMATHCrossRefGoogle Scholar
  74. 74.
    Tanaev VS, Gordon VS, Shafransky YM (1994) Scheduling Theory. Single-Stage Systems, vol 284. Springer, NetherlandszbMATHCrossRefGoogle Scholar
  75. 75.
    Vallada E, Ruiz R (2011) A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur J Oper Res 211(3):612–622MathSciNetCrossRefGoogle Scholar
  76. 76.
    Wang J, Ng C, Cheng T (2008) Single-machine scheduling with deteriorating jobs under a series parallel graph constraint. Comput Oper Res 35(8):2684–2693MathSciNetzbMATHCrossRefGoogle Scholar
  77. 77.
    Wang L, Huang X, Ji P, Feng E (2014) Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time. Optim Lett 8(1):129–134MathSciNetzbMATHCrossRefGoogle Scholar
  78. 78.
    Woo Y, Jung S, Kim BS (2017) A rule-based genetic algorithm with an improvement heuristic for unrelated parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities. Comput Ind Eng 109:179– 190CrossRefGoogle Scholar
  79. 79.
    Yang-Kuei L, Chi-Wei L (2013) Dispatching rules for unrelated parallel machine scheduling with release dates. The International Journal of Advanced Manufacturing TechnologyGoogle Scholar
  80. 80.
    Ying K, Lee Z, Lin S (2012) Makespan minimization for scheduling unrelated parallel machines with setup times. Journal of Intelligent ManufacturingGoogle Scholar
  81. 81.
    Yoon K, Hwang C (1981) Multiple attribute decision makingGoogle Scholar
  82. 82.
    Zhang X, Xu D, Du D, Miao C (2016a) Approximate algorithms for unrelated machine scheduling to minimize makespan, vol 12Google Scholar
  83. 83.
    Zhang X, Yin Y, Wu C (2016b) Scheduling with non decreasing deterioration jobs and variable maintenance activities on a single machine. Eng Optim 48:1–14MathSciNetCrossRefGoogle Scholar
  84. 84.
    Zhao C, Tang H (2014) Parallel machines scheduling with deteriorating jobs and availability constraints. Japan Journal of Industrial and Applied MathematicsGoogle Scholar
  85. 85.
    Zhu H, Li M, Zhou Z, You Y (2016) Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity. Int J Prod Res 54(12):3475–3490CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Ltd., part of Springer Nature 2018

Authors and Affiliations

  • Meriem Tigane
    • 1
  • Mohammed Dahane
    • 2
    Email author
  • Mourad Boudhar
    • 1
  1. 1.RECITS LaboratoryFaculty of Mathematics USTHB University El-AliaBab-EzzouarAlgeria
  2. 2.LGIPMUniversité de LorraineMetzFrance

Personalised recommendations