Skip to main content

Advertisement

Springer Nature Link
Log in

Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

The joint production scheduling and preventive maintenance problems have recently attracted researchers’ attention given their contribution, both the production and the maintenance functions and their integration, to the firms’ efficiency. In this paper, we deal with production scheduling and preventive maintenance (PM) planning on single machine problem. The aim is to find an appropriate sequencing of production jobs and a PM planning to minimize two objectives simultaneously: total tardiness of jobs and machine unavailability. We propose a bi-objective exact algorithm, that we called BOBB, based on bi-objective branch and bound method to find the efficient set. We introduced several properties and bound sets to enhance the performance of the proposed BOBB algorithm. Furthermore, we propose a hybrid method, that we called GA-BBB, based on genetic algorithm and binary branch and bound algorithm to compute an approximate efficient set to be used as an initial upper bound set in the BOBB algorithm. An experimental study was conducted to show the efficiency of the GA-BBB and the BOBB algorithms.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Basseur M, Lemesre J, Dhaenens C, Talbi, E-G (2004) Cooperation between branch and bound and evolutionary approaches to solve a bi-objective flow shop problem. Workshop on experimental and efficient algorithms (WEA"04), Rio de Janeiro, Brazil, pp 72–86

  • Berrichi A, Yalaoui F (2013) Efficient bi-objective ant colony approach to minimize total tardiness and system unavailability for a parallel machine scheduling problem. Int J Adv Manuf Technol 68:2295–2310

    Article  Google Scholar 

  • Berrichi A, Amodeo L, Yalaoui F, Châtelet E, Mezeghiche M (2009) Bi-objective optimization algorithms for joint production and maintenance scheduling. Application to the parallel machine problem. J Intell Manuf 20:389–400

    Article  Google Scholar 

  • Berrichi A, Amodeo L, Yalaoui F, Mezghiche M (2010) Bi-objective ant colony optimization approach to optimize production and maintenance scheduling. Comput Oper Res 37(9):1584–1596

    Article  Google Scholar 

  • Cassady CR, Kutanoglu E (2003) Minimizing job tardiness using integrated preventive maintenance planning and production scheduling. IIE Trans 35:503–513

    Article  Google Scholar 

  • Cassady CR, Kutanoglu E (2005) Integrating preventive maintenance planning and production scheduling for a single machine. IEEE Trans Reliab 54(2):304–309

    Article  Google Scholar 

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

    Article  Google Scholar 

  • 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–197

    Article  Google Scholar 

  • Ebeling CE (1979) An introduction to reliability and maintainability engineering. McGraw_Hill, New York

    Google Scholar 

  • Ehrgott M, Gandibleux X (2007) Bounds sets for biobjective combinatorial optimization problems. Comput Oper Res 34:2674–2694

    Article  Google Scholar 

  • Ehrgott M, Gandibleux X, Przybylski A (2016) Exact Methods for Multi-Objective combinatorial optimization. In: Greco S, Ehrgott M, Figueira JR (eds) Multiple criteria decision analysis, vol 233. International series in operations research & management science. Springer, New York, pp 817–850

    Chapter  Google Scholar 

  • Fitouhi M-C, Nourelfath M (2012) Integrating noncyclical preventive maintenance scheduling and production planning for single machine. Int J Prod Econ 136:344–351

    Article  Google Scholar 

  • Kaabi J (2004) Contribution à l’ordonnancement des activités de maintenance dans les systèmes de production. Thèse de doctorat, Université de Franche-Comté

  • Kacem I, Chu C (2008) Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on single machine with one unavailability constraint. Int J Prod Econ 112:138–150

    Article  Google Scholar 

  • Koulamas C (2010) The single-machine total tardiness scheduling problem: review and extensions. Eur J Oper Res 20:1–7

    Article  Google Scholar 

  • Liao CJ, Chen WJ (2003) Single-machine scheduling with periodic maintenance and nonresumable jobs. Comput Oper Res 30:1335–1347

    Article  Google Scholar 

  • Liao W, Zhang X, Jiang M (2017) Multi-objective goup scheduling optimization integrated with preventive maintenance. Eng Optim. https://doi.org/10.1080/0305215X.2017.1280258

    Article  Google Scholar 

  • Lust T, Teghem J (2010) Two-phase Pareto local search for the bi-objective traveling salesman problem. J Heuristics 16:475–510

    Article  Google Scholar 

  • Mavrotas G, Diakoulaki D (1998) A branch and bound algorithm for mixed zero-one multiple objective linear programming. Eur J Operational Res 107(3):530–541

    Article  Google Scholar 

  • Moradi E, Zandieh M (2010) Minimizing the makespan and the system unavailability in parallel machine scheduling problem: a similarity-based genetic algorithm. Int J Adv Manuf Technol 51:829–840

    Article  Google Scholar 

  • Moradi E, Ghomi Fatemi SMT, Zandieh M (2011) Bi-objective optimization research on integrated fixed time interval preventive maintenance and production for scheduling flexible job-shop problem. Expert Syst Appl 38:7169–7178

    Article  Google Scholar 

  • Moshieov G, Sidney JB (2010) Scheduling a deteriorating maintenance activity on a single machine. J Oper Res Soc 61:882–887

    Article  Google Scholar 

  • Pinedo ML (2008) Scheduling: theory, algorithms, and systems. Springer, New York

    Google Scholar 

  • Ruiz R, Garcia-Diaz JC, Maroto C (2007) Concepcion considering scheduling and preventive maintenance in the flowshop sequencing problem. Comput Oper Res 34:3314–3330

    Article  Google Scholar 

  • Sbihi M, Varnier C (2008) Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness. Comput Ind Eng 55:830–840

    Article  Google Scholar 

  • Schaller J (2009) Note on Shim and Kim’s lower bounds for scheduling on identical parallel machines to minimize total tardiness. Eur J Operational Res 197:422–426

    Article  Google Scholar 

  • Shim SO, Kim YD (2007a) Minimizing total tardiness in an unrelated parallel-machine scheduling problem. J Oper Res Soc 58:346–354

    Article  Google Scholar 

  • Shim S-O, Kim Y-D (2007b) Scheduling on parallel identical machines to minimize total tardiness. Eur J Oper Res 177:135–146

    Article  Google Scholar 

  • Sourd F, Spanjaard O (2008) A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem. INFORMS J Comp 20:472–484

    Article  Google Scholar 

  • Villemeur A (1991) Reliability, availability, maintainability and safety assessment. Wiley, USA

  • Vincent T, Seipp F, Ruzika S, Przybylski A, Gandibleux X (2013) Multiple objective branch and bound for mixed 0-1 linear programming. Corrections and improvements for the biobjective case. Comput Oper Res 40:498–509

    Article  Google Scholar 

  • Visee M, Teghem J, Pirlot M, Ulungu EL (1998) Two-phases method and branch and bound procedures to solve the bi–objective knapsack problem. J Global Optim 12:139–155

    Article  Google Scholar 

  • Wang S, Liu M (2013) A branch and bound algorithm for single machine production scheduling integrated with preventive maintenance planning. Int J Prod Res 51(3):847–868

    Article  Google Scholar 

  • Yang S-L, Ma Y, Xu D-L, Yang J-B (2011) Minimizing total completion time on a single machine with a flexible maintenance activity. Comput Oper Res 38:755–770

    Article  Google Scholar 

  • Yazdani M, Khalili SM, Babagolzadeh M, Jolai F (2017) A single-machine scheduling problem with multiple unavailability constraints: a mathematical model and an enhanced variable neighborhood search approach. J Comput Des Eng 4:46–59

    Google Scholar 

  • Ye J, Ma H (2015) Multiobjective joint optimization of production scheduling and maintenance planning in the flexible job-shop problem. Math Probl Eng, Article ID 725460

  • Yulan J, Zuhua J, Wenrui H (2008) Multi-objective integrated optimization research on preventive maintenance planning and production scheduling for a single machine. Int J Adv Manuf Technol 39:954–964

    Article  Google Scholar 

  • Zahedi Z, Ari Samadhi TMA, Suprayogi S, Halim AH (2016) Integrated batch production and maintenance scheduling for multiple items processed on a deteriorating machine to minimize total production and maintenance costs with due date constraint. Int J Ind Eng Comput 7:229–244

    Google Scholar 

  • Zhao C-L, Tang H-Y (2010) Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan. App Math Model 34:837–841

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIMOSE Laboratory, Computer Science Department, Faculty of Sciences, University M’Hamed Bougara of Boumerdes, Independency Avenue, 35000, Boumerdès, Algeria

    Asmaa Khoudi & Ali Berrichi

Authors
  1. Asmaa Khoudi
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Ali Berrichi
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Asmaa Khoudi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Khoudi, A., Berrichi, A. Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm. Oper Res Int J 20, 1763–1789 (2020). https://doi.org/10.1007/s12351-018-0384-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-018-0384-3

Keywords