Skip to main content
SpringerLink
Log in

A parallel-machine scheduling problem with periodic maintenance under uncertainty

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

A parallel-machine scheduling problem with preventive maintenance is studied in the paper. Because of the existence of indeterminacy phenomenon, the processing and maintenance time are assume to be uncertain variables. To address these uncertain parameters, two pessimistic value mathematical programming models are developed and the equivalence is proved. The worst-case bound of longest processing time (LPT) rule for the problem under an uncertain environment is obtained. To solve this problem effectively, an improved LPT rule is proposed according to the result of the theoretical analysis. Finally, numerical experiments show that the improved LPT outperforms the LPT in improving the quality of the optimal value and has a less relative error than that of the LPT.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Alimoradi S, Hematian M, Moslehi G (2016) Robust scheduling of parallel machines considering total flow time. Comput Ind Eng 93:152–161

    Article  Google Scholar 

  • Allaoui H, Artiba A (2006) Scheduling two-stage hybrid flow shop with availability constraints. Comput Oper Res 33:1399–1419

    Article  MathSciNet  MATH  Google Scholar 

  • Benmansour R, Allaoui H, Artiba A, Hanafi S (2014) Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance. Comput Oper Res 47:106–113

    Article  MathSciNet  MATH  Google Scholar 

  • Chen WJ (2009) Minimizing number of tardy jobs on a single machine subject to periodic maintenance. Omega 37:591–599

    Article  Google Scholar 

  • Chen XW, Ralescu D (2012) B-spline method of uncertain statistics with application to estimating travel distance. J Uncertain Syst 6(4):256–262

    Google Scholar 

  • Deng LB, Chen YF (2016) Optimistic value model of uncertain linear quadratic optimal control with jump. J Adv Comput Intell Intell Inform 20(2):189–196

    Article  Google Scholar 

  • Eduardo LR, Stefan V (2016) Modelling the parallel machine scheduling problem with step deteriorating jobs. Eur J Oper Res 255(1):21–33

    Article  MATH  Google Scholar 

  • Gao Y, Gao R, Yang LX (2015) Analysis of order statistics of uncertain variables. J Uncertain Anal Appl 3(1):1

    Article  Google Scholar 

  • Hnaien F, Yalaoui F, Mhadhbi A (2015) Makespan minimization on a two-machine flow shop with an availability constraint on the first machine. Int J Prod Econ 164:95–104

    Article  Google Scholar 

  • Jiang DK, Tan JY (2016) Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines. Theor Comput Sci 616:94–99

    Article  MathSciNet  MATH  Google Scholar 

  • Ke H, Liu JJ (2017) Dual-channel supply chain competition with channel preference and sales effort under uncertain environment. J Ambient Intell Humaniz Comput 8:781–795

    Article  Google Scholar 

  • Koulamas C, Kyparisis GJ (2008) An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines. Eur J Oper Res 187(2):660–666

    Article  MathSciNet  MATH  Google Scholar 

  • Koulamas C, Kyparisis GJ (2009) A modified LPT algorithm for the two uniform parallel machine makespan minimization problem. Eur J Oper Res 196(1):61–68

    Article  MathSciNet  MATH  Google Scholar 

  • Lee CY (1996) Machine scheduling with an availability constraint. J Glob Optim 9(3):395–416

    Article  MathSciNet  MATH  Google Scholar 

  • Lee JY, Kim YD (2012) Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance. Comput Oper Res 39:2196–2205

    Article  MathSciNet  MATH  Google Scholar 

  • Lee WC, Wang JY, Lin MC (2016) A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents. Knowl-Based Syst 105(1):68–82

    Article  Google Scholar 

  • Li X, Liu BD (2009) Hybrid logic and uncertain logic. J Uncertain Syst 3(2):83–94

    MathSciNet  Google Scholar 

  • Liu BD (2007) Uncertainty theory, 2nd edn. Springer, Berlin

    MATH  Google Scholar 

  • Liu BD (2009) Some research problem in uncertainty theory. J Uncertain Syst 3(1):3–10

    Google Scholar 

  • Liu BD (2010) Uncertainty theory: a branch of mathematics for modeling human uncertainty. Springer, Berlin

    Book  Google Scholar 

  • Liu W (2013) Some new theorems on uncertain renewal process. Information 16(2):1145–1150

    Google Scholar 

  • Low CY, Hsu CJ, Su CT (2010) A modified particle swarm optimization algorithm for a single-machine scheduling problem with periodic maintenance. Expert Syst Appl 37:6429–6434

    Article  Google Scholar 

  • Low CY, Ji M, Hsu CJ, Su CT (2010) Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance. Appl Math Model 34:334–342

    Article  MathSciNet  MATH  Google Scholar 

  • Mir SSM, Rezaeian J (2016) A robust hybrid approach based on particle swarm optimization and genetic algorithm to minimize the total machine load on unrelated parallel machines. Appl Soft Comput 41:488–504

    Article  Google Scholar 

  • Naderi B, Zandieh M, Aminnayeri M (2011) Incorporating periodic preventive maintenance into flexible flowshop scheduling problems. Appl Soft Comput 11:2094–2101

    Article  Google Scholar 

  • Shen LX, Wang D, Wang XY (2013) Parallel-machine scheduling with non-simultaneous machine available time. Appl Math Model 37:5227–5232

    Article  MathSciNet  MATH  Google Scholar 

  • Shen JY, Zhu YG (2017) Uncertain flexible flow shop scheduling problem subject to breakdowns. J Intell Fuzzy Syst 32(1):207–214

    Article  MATH  Google Scholar 

  • Shi G, Sheng YH, Ralescu D (2017) The maximum flow problem of uncertain random network. J Ambient Intell Humaniz Comput 8:667–675

    Article  Google Scholar 

  • Sortrakul N, Nachtmann HL, Cassady CR (2005) Genetic algorithms for integrated preventive maintenance planning and production scheduling for a single machine. Comput Ind 56:161–168

    Article  Google Scholar 

  • Wang XL, Cheng TCE (2015) A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint. Int J Prod Econ 161:74–82

    Article  Google Scholar 

  • Wang CJ, Liu CC, Zhang ZH, Zheng L (2016) Minimizing the total completion time for parallel machine scheduling with job splitting and learning. Comput Ind Eng 97:170–182

    Article  Google Scholar 

  • Wang JJ, Wang JB, Liu F (2011) Parallel machines scheduling with a deteriorating maintenance activity. J Oper Res Soc 62(10):1898–1902

    Article  Google Scholar 

  • Wang XY, Zhou ZL, Ji P, wang JB (2014) Parallel machines scheduling with simple linear job deterioration and non-simultaneous machine available times. Comput Ind Eng 74:88–91

    Article  Google Scholar 

  • Xu DH, Sun KB, Li HX (2008) Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan. Comput Oper Res 35(4):1344–1349

    Article  MathSciNet  MATH  Google Scholar 

  • Yan HY, Zhu YG (2015) Bang-bang control model for uncertain switched systems. Appl Math Model 39(10–11):2994–3002

    Article  MathSciNet  Google Scholar 

  • Yao K (2015) Uncertain differential equation with jumps. Soft Comput 19(7):2063–2069

    Article  MATH  Google Scholar 

  • Yao K, Ke H, Sheng YH (2015) Stability in mean for uncertain differential equation. Fuzzy Optim Decis Mak 14(3):365–379

    Article  MathSciNet  MATH  Google Scholar 

  • Yin YQ, Cheng TCE, Wang DJ (2016) Rescheduling on identical parallel machines with machine disruptions to minimize total completion time. Eur J Oper Res 252:737–749

    Article  MathSciNet  MATH  Google Scholar 

  • Zhu K, Shen JY, Yao XL (2018) A three-echelon supply chain with asymmetric information under uncertainty. J Ambient Intell Humaniz Comput. https://doi.org/10.1007/s12652-018-0705-7

    Google Scholar 

Download references

Acknowledgements

We are 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).

Author information

Authors and Affiliations

  1. Department of Public Basic Courses, Nanjing Institute of Industry Technology, Nanjing, 210023, Jiangsu, People’s Republic of China

    Jiayu Shen

  2. School of Science, Nanjing University of Science and Technology, Nanjing, 210094, Jiangsu, People’s Republic of China

    Yuanguo Zhu

Authors
  1. Jiayu Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuanguo Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jiayu Shen.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shen, J., Zhu, Y. A parallel-machine scheduling problem with periodic maintenance under uncertainty. J Ambient Intell Human Comput 10, 3171–3179 (2019). https://doi.org/10.1007/s12652-018-1032-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-018-1032-8

Keywords

Search

Navigation