An uncertain parallel machine problem with deterioration and learning effect

  • Jiayu ShenEmail author


An uncertain uniform parallel machine scheduling problem with job deterioration and a learning effect is considered. Job processing times, due dates, deterioration rates and learning rates are assumed to be uncertain variables. The objective functions are the total weight earliness, tardiness and makespan. Three mathematical programming models are presented, i.e., expected value model, pessimistic value model and measure chance model. These models can be converted into equivalent crisp models by the inverse uncertainty distribution method. A hybrid algorithm mixed with dispatching rules based on structural features is employed to solve the problem. Finally, computational experiments are presented to illustrate the effectiveness of proposed algorithms.


Parallel machine scheduling Job deterioration Learning effect Uncertain environment Hybrid algorithm 

Mathematics Subject Classification

Primary 90B99 Secondary 90C29 



I am grateful to the editor and the anonymous reviewers for their helpful suggestions on an earlier version of this paper. This work is supported by the National Natural Science Foundation of China (No. 61673011).


  1. Aalaei A, Kayvanfar V, Davoudpour H (2017) A multi-objective optimization for preemptive identical parallel machines scheduling problem. Comput Appl Math 36(3):1367–1387MathSciNetzbMATHGoogle Scholar
  2. Agnetis A, Billaut J, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling. Springer, BerlinzbMATHGoogle Scholar
  3. Cheng T, Wang G (2000) Single machine scheduling with learning effect considerations. Ann Oper Res 98(1–4):273–290MathSciNetzbMATHGoogle Scholar
  4. Cheng T, Tseng S, Lai P, Lee W (2013) Single-machine scheduling with accelerating learning effects. Math Prob Eng 8(2):543–554MathSciNetzbMATHGoogle Scholar
  5. Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173–178zbMATHGoogle Scholar
  6. Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495–498zbMATHGoogle Scholar
  7. Dayama N, Krishnamoorthy M, Ernst A, Rangaraj N, Narayanan V (2015) History-dependent scheduling: models and algorithms for scheduling. Comput Oper Res 64:245–261MathSciNetzbMATHGoogle Scholar
  8. Fanjul-Peyro L, Perea F, Ruiz R (2017) Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources. Eur J Oper Res 260:482–493MathSciNetzbMATHGoogle Scholar
  9. Gawiejnowicz S (1996) A note on scheduling on a single processor with speed dependent on a number of executed jobs. Inf Process Lett 57(6):297–300MathSciNetzbMATHGoogle Scholar
  10. Gawiejnowicz S (2008) Time-dependent scheduling. Springer, BerlinzbMATHGoogle Scholar
  11. Gawiejnowicz S, Kononov A (2010) Complexity and approximability of scheduling resumable proportionally deteriorating jobs. Eur J Oper Res 200:305–308zbMATHGoogle Scholar
  12. Gawiejnowicz S, Lin B (2010) Scheduling time-dependent jobs under mixed deterioration. Appl Math Comput 216:438–447MathSciNetzbMATHGoogle Scholar
  13. Gawiejnowicz S, Lee W, Lin C, Wu C (2011) Single-machine scheduling of proportionally deteriorating jobs by two agents. J Oper Res Soc 62(11):1983–1991Google Scholar
  14. Gawiejnowicz S, Suwalski C (2014) Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria. Comput Oper Res 52:135–146MathSciNetzbMATHGoogle Scholar
  15. Gawiejnowicz S, Kurc W (2015) Structural properties of time-dependent scheduling problems with the lp norm objective. Omega 57:196–202Google Scholar
  16. Hamidinia A, Khakabimamaghani S, Mazdeh M, Jafari M (2012) A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system. Comput Ind Eng 62(1):29–38Google Scholar
  17. Hallah R (2007) Minimizing total earliness and tardiness on a single machine using a hybrid heuristic. Comput Ind Eng 34(10):3126–3142zbMATHGoogle Scholar
  18. Jolai F, Rabbani M, Amalnick S, Dabaghi A, Dehghan M, YazdanParas M (2007) Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs. Appl Math Comput 194(2):552–560MathSciNetzbMATHGoogle Scholar
  19. Joo C, Kim B (2015) Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability. Comput Ind Eng 85:02–109Google Scholar
  20. Kayvanfar V, Zandieh M, Teymourian E (2017) An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach. Comput Appl Math 36(1):159–184MathSciNetzbMATHGoogle Scholar
  21. Kuo W, Yang D (2007) Single-machine scheduling problems with the time-dependent learning effect. Comput Math Appl 53(11):1733–1739MathSciNetzbMATHGoogle Scholar
  22. Lee K, Kim B, Joo C (2012) Genetic algorithms for door-assigning and sequencing of trucks at distribution centers for the improvement of operational performance. Expert Syst Appl 39(17):12975–12983Google Scholar
  23. Li H (2017) Stochastic single-machine scheduling with learning effect. IEEE Trans Eng Manag 64(1):94–102Google Scholar
  24. Li G, Liu M, Sethi S, Xu D (2017) Parallel-machine scheduling with machine-dependent maintenance periodic recycles. Int J Prod Econ 186:1–7Google Scholar
  25. Liu B (2007) Uncertainty theory, 2nd edn. Springer, BerlinzbMATHGoogle Scholar
  26. Liu B (2010) Uncertainty theory: a branch of mathematics for modeling human uncertainty. Springer, BerlinGoogle Scholar
  27. Liu B (2009) Some research problems in uncertainty theory. J Uncertain Syst 3(1):3–10Google Scholar
  28. Liu B (2012) Why is there a need for uncertainty theory? J Uncertain Syst 6(1):3–10Google Scholar
  29. Liu M (2013) Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect. Appl Math Model 37(23):9630–9633MathSciNetzbMATHGoogle Scholar
  30. McKay K, Pinedo M, Webster S (2002) Practice-focused research issues for scheduling systems. Prod Oper Manag 11:249–258Google Scholar
  31. Mosheiov G (2001) Scheduling problems with a learning effect. Eur J Oper Res 132(3):687–693MathSciNetzbMATHGoogle Scholar
  32. Singh A, ValenteMaria J, Moreira M (2012) Hybrid heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs. Int J Mach Learn Cybern 3(4):327–333Google Scholar
  33. Smith W (1956) Various optimizers for single-stage production. Naval Res Logist Quart 3(1–2):59–66MathSciNetGoogle Scholar
  34. Soroush H (2014) Stochastic bicriteria single machine scheduling with sequence-dependent job attributes and job-dependent learning effects. Eur J Oper Res 8(4):421–456Google Scholar
  35. Toksari M, Güner E (2009) Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration. Comput Oper Res 36(8):2394–2417zbMATHGoogle Scholar
  36. Wang X, Zhou Z, Ji P, Wang J (2014) Parallel machines scheduling with simple linear job deterioration and non-simultaneous machine available times. Comput Ind Eng 74:88–91Google Scholar
  37. Yin Y, Cheng T, Wu C, Cheng S (2014) Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity. Int J Prod Res 52(19):5583–5596Google Scholar
  38. Yin Y, Wang Y, Cheng T, Liu W, Li J (2017) Parallel-machine scheduling of deteriorating jobs with potential machine disruptions. Omega 69:17–28Google Scholar
  39. Yoo J, Lee I (2016) Parallel machine scheduling with maintenance activities. Comput Ind Eng 101:361–371Google Scholar
  40. Zhang Y, Wu X, Zhou X (2013) Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns. J Sched 16(3):331–336MathSciNetzbMATHGoogle Scholar
  41. Zhang M, Luo C (2013) Parallel-machine scheduling with deteriorating jobs, rejection and a fixed non-availability interval. Appl Math Comput 224(1):405–411MathSciNetzbMATHGoogle Scholar
  42. Zhong X, Ou J (2017) Parallel machine scheduling with restricted job rejection. Theoretical Comput Sci 690:1–11MathSciNetzbMATHGoogle Scholar

Copyright information

© SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional 2019

Authors and Affiliations

  1. 1.Department of Public Basic CoursesNanjing Institute of Industry TechnologyNanjingPeople’s Republic of China

Personalised recommendations