Skip to main content
SpringerLink
Log in

Game theory-based integration of scheduling with flexible and periodic maintenance planning in the permutation flowshop sequencing problem

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

Abstract

We introduce a novel game theory approach to the problem of integrating periodic and flexible preventive maintenance and production scheduling for permutation flowshops. Our main contribution is to propose game modeling that allows decision maker to have compromise solutions meeting at best production and maintenance criteria. To achieve this, two new games formulations for the problem are proposed, and a stable solution for the players is obtained through the concept of equilibrium. The first game follows a constructive approach while the second one follows an improvement one. Moreover, to cope with the concept of game types, we proposed two player’s behaviors: rational and non-rational. Extensive experiments are carried out to validate our proposed approaches and developed methods. Besides, the results of the proposed methods are compared against the state of the art, highlighting our contributions and showing improvements.

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
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  • Aggoune R (2004) Minimizing the makespan for the flowshop scheduling problem with availability constraints. Eur J Oper Res 153(3):534–543

    Article  Google Scholar 

  • Ahire S, Greenwood G, Gupta A, Terwilliger M (2000) Workforce-constrained preventive maintenance scheduling using evolution strategies. Decis Sci J 31(4):833–859

    Article  Google Scholar 

  • Allaoui H, Artiba A (2004) Integrating simulation and optimization to scheduling a hybrid flow shop with maintenance constraints. Comput Ind Eng 47(4):431–450

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Allaoui H, Lamouri S, Artiba A, Aghezzaf E (2008) Simultaneously scheduling jobs and the preventive maintenance on the two-machine flowshop to minimize the makespan. Int J Prod Econ 112(1):161–167

    Article  Google Scholar 

  • Benbouzid-Si Tayeb F, Belkaaloul W (2014) Towards an artificial immune system for scheduling jobs and preventive maintenance operations in flowshop problems. In: Proceeding of IEEE 23rd International Symposium on Industrial Electronics (ISIE’2014), pp 1065–1070

  • Benbouzid-Si Tayeb F, Varnier C, Zerhouni N (2003) Resolution of joint maintenance/production scheduling by sequential and integrated strategies. In: Proceeding of the 7th International Work Conference on Artificial and Natural Neural Networks (IWANN’2003), LNCS 2687, pp 782–789

  • Benbouzid-Si Tayeb F, Ammi I, Varnier C, Zerhouni N (2008) An integrated ACO approach for the joint production and preventive maintenance scheduling problem in the flowshop sequencing problem. In: Proceedings of the IEEE International Symposium on Industrial Electronics (ISIE’2008), pp 2532–2537

  • Benbouzid-Si Tayeb F, Guebli SA, Bessadi Y, Varnier C, Zerhouni N (2011) Joint scheduling of jobs and preventive maintenance operations in the flowshop sequencing problem: a resolution with sequential and integrated strategies. Int J Manag Res 6(1):30–48

    Google Scholar 

  • Benbouzid-Si Tayeb F, Messiaid A, Benatchba K (2015) Game theoretic modelling of the integrated production and preventive maintenance scheduling problem in permutation flowshops. In: Proceeding of IEEE 54th IEEE Conference on Decision and Control, December (CDC’2015)

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

    Article  Google Scholar 

  • Berrichi A, Yalaoui F, Amodeo L, 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 

  • Calleja P, EstéVez-FernáNdez A, Borm P (2006) Job scheduling, cooperation, and control. Oper Res Lett 34(1):22–28

    Article  Google Scholar 

  • Charilas DE, Panagopoulos AD (2010) A survey on game theory applications in wireless networks. Comput Netw 54(18):3421–3430

    Article  Google Scholar 

  • Cochran JK, Horng S-M, Fowler JW (2003) A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Comput Oper Res 30(7):1087–1102

    Article  Google Scholar 

  • Curiel I, Pederzoli G, Tijs S (1989) Sequencing games. Eur J Oper Res 40(3):344–351

    Article  Google Scholar 

  • Curiel I, Hamers H, Klijn F (2002) Sequencing games: a survey. In: Borm P, Peters H (eds) Chapters in game theory. Theory and decision library C, vol 31, pp 27–50

  • Davis L (1985) Job-shop scheduling with genetic algorithms. In: Proceedings of the First International Conference on Genetic Algorithms and their Applications, pp 136–140

  • Djerid L, Portmann MC (2000) How to keep good schemata using crossover operators for the permutation problems. Int Trans Oper Res 7(6):637–651

    Article  Google Scholar 

  • Estévez-Fernández MA, Borm PEM, Calleja P, Hamers HJM (2008a) Sequencing games with repeated players. Ann Oper Res 158(1):189–203

    Article  Google Scholar 

  • Estévez-Fernández MA, Mosquera MA, Borm PEM, Hamers HJM (2008b) Proportionate flow shop games. J Sched 11(6):433–447

    Article  Google Scholar 

  • Framinan JM, Leisten R, Rajendran C (2003) Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. Int J Prod Res 41(1):121–148

    Article  Google Scholar 

  • Fudenberg D, Tirole J (1991) Game theory. MIT Press, Cambridge

    Google Scholar 

  • Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117–129

    Article  Google Scholar 

  • Hamers H, Klijn F, Suijs J (1999) On the balancedness of multiple machine sequencing games. Eur J Oper Res 119(3):678–691

    Article  Google Scholar 

  • Hejazi S, Saghafian S (2005) Flowshop scheduling problems with makespan criterion: a review. Int J Prod Res 43(14):2895–2929

    Article  Google Scholar 

  • Jabbarizadeh F, Zandieh M, Talebi D (2009) Hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints. Comput Ind Eng 57(3):949–957

    Article  Google Scholar 

  • Kaabi J, Varnier C, Zerhouni N (2003) Ordonnancement de la production et de la maintenance: cas d’un atelier de type flowshop a deux machines. APII J Eur des Syst Autom 37(5):641–660

    Google Scholar 

  • Krasnogor N (2005) Smith J.A tutorial for competent memetic algorithms: model, taxonomy, and design issues. IEEE Trans Evol Comput 9(5):474–488

    Article  Google Scholar 

  • Kubiak W, Blazewicz J, Formanowicz P, Breit J, Schmidt G (2002) Two-machine flowshops with limited machine availability. Eur J Oper Res 136(3):528–540

    Article  Google Scholar 

  • Lee CY (1997) Minimizing the makespan in the two machines flowshop scheduling problem with an availability constraint. Oper Res Lett 20(3):129–139

    Article  Google Scholar 

  • Legat V, Zaludova AH, Cervenka V, Jurca V (1996) Contribution to optimization of preventive maintenance. Reliab Eng Syst Saf 51(3):259–266

    Article  Google Scholar 

  • Li X, Gao L, Li W (2012) Application of game theory based hybrid algorithm for multi-objective integrated process planning and scheduling. Expert Syst Appl 39(1):288–297

    Article  Google Scholar 

  • Li J-Q, Pan Q-K, FatihTasgetiren M (2014) A discrete artificial bee colony algorithm for the multi-objective flexible jobshop scheduling problem with maintenance activities. Appl Math Model 38(3):1111–1132

    Article  Google Scholar 

  • Ma Y, Chu C, Zuo C (2010) A survey of scheduling with deterministic machine availability constraints. Comput Ind Eng 58(2):199–211

    Article  Google Scholar 

  • Moghaddam KS (2013) Multi-objective preventive maintenance and replacement scheduling in a manufacturing system using goal programming. Int J Prod Econ 146(2):704–716

    Article  Google Scholar 

  • Moghaddam KS, Usher JS (2011) A new multi-objective optimization model for preventive maintenance and replacement scheduling of multi-component systems. Eng Optim 43(7):701–719

    Article  Google Scholar 

  • Moradi E, FatemiGhomi 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(6):7169–7178

    Article  Google Scholar 

  • Murata T, Ishibuchi H, Tanaka H (1996) Genetic algorithms for flowshop scheduling problems. Comput Ind Eng 30(4):1061–1071

    Article  Google Scholar 

  • Naderi B, Zandieh M, FatemiGhomi SMT (2009) Scheduling sequence-dependent setup time jobshops with preventive maintenance. Int J Adv Manuf Technol 43(1–2):170–181

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Nawaz M, Emscore JR, Ham I (1983) A heuristic algorithm for the m-machine n-job flowshop sequencing problems. Omega 11(1):91–95

    Article  Google Scholar 

  • NguyenH D, Yoshihara I, Yamamori K, Yasunaga M (2007) Implementation of an effective hybrid ga for large-scaletraveling salesman problems. IEEE Trans Syst Man Cybern Part B 37(1):92–99

    Article  Google Scholar 

  • Osborne MJ (2004) An introduction to game theory, 1st edn. Oxford University Press, Oxford

    Google Scholar 

  • Pan Q-K, Ruiz R (2013) A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. Comput Oper Res 40(1):117–128

    Article  Google Scholar 

  • Pinedo M (2002) Scheduling: theory, algorithms and systems. Prentice Hall, Upper Saddle river

    Google Scholar 

  • Ruiz R, Maroto C (2005) A comprehensive review and evaluation of permutation flowshop heuristics. Eur J Oper Res 165(2):479–494

    Article  Google Scholar 

  • Ruiz R, García-Díaz JC, Maroto C (2007) Considering scheduling and preventive maintenance in the flowshop sequencing problem. Comput Oper Res 34(11):3314–3330

    Article  Google Scholar 

  • Schmidt G (2000) Scheduling with limited machine availability. Eur J Oper Res 121(1):1–15

    Article  Google Scholar 

  • Shapiro JF (1993) Mathematical programming models and methods for production planning and scheduling. In: Graves SC, RinnooyKan AHG, Zipkin PH (eds) Handbooks in operations research and management science logistics of production and inventory, vol 4. North-Holland, Amsterdam

    Google Scholar 

  • Sheu SH, Yeh RH, Lin YB, Juang MG (2001) A Bayesian approach to an adaptive preventive maintenance model. Reliab Eng Syst Saf 71(1):33–44

    Article  Google Scholar 

  • Taillard E (1990) Some efficient heuristic methods for the flowshop sequencing problem. Eur J Oper Res 47(1):65–74

    Article  Google Scholar 

  • Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285

    Article  Google Scholar 

  • Taylor PD (1979) Evolutionarily stable strategies with two types of player. J Appl Probab 16(1):76–83

    Article  Google Scholar 

  • Vaurio JK (1997) On time-dependent availability and maintenance optimization of standby units under various maintenance policies. Reliab Eng Syst Saf 56(1):79–89

    Article  Google Scholar 

  • Xiaotong L, Yimei L, Xiaoli Z, Ming Z (2012) Generation and transmission expansion planning based on game theory in power engineering. Syst Eng Procedia 4:79–86

    Article  Google Scholar 

  • Yang DL, Hsu CJ, Kuo WH (2008) A two-machine flowshop scheduling problem with a separated maintenance constraint. Comput Oper Res 35(3):876–883

    Article  Google Scholar 

  • 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(9–10):954–964

    Article  Google Scholar 

  • Zhou Y, Gu X (2008) Research on flow shop scheduling problem with multi-customer and fuzzy due date based on non-cooperative games. In: Proceedings of the IEEE International Symposium on Knowledge Acquisition and Modeling Workshop, KAM Workshop 2008, pp 757–760

  • Zhou Y, Gu X (2009) Research on no-wait flow shop scheduling problem with fuzzy due date based on evolution games. In: Proceedings of the second IEEE International Conference on Computer Science and Information Technology, ICCSIT 2009, pp 495–499

Download references

Author information

Authors and Affiliations

  1. Laboratoire des Méthodes de Conception de Systèmes (LMCS), Ecole Nationale Supérieure d’Informatique of Algiers (ESI ex INI), BP 68 M Oued Smar, 16270, Algiers, Algeria

    Fatima Benbouzid-Si Tayeb, Karima Benatchba & Abd-Essalam Messiaid

Authors
  1. Fatima Benbouzid-Si Tayeb
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karima Benatchba
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abd-Essalam Messiaid
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fatima Benbouzid-Si Tayeb.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Benbouzid-Si Tayeb, F., Benatchba, K. & Messiaid, AE. Game theory-based integration of scheduling with flexible and periodic maintenance planning in the permutation flowshop sequencing problem. Oper Res Int J 18, 221–255 (2018). https://doi.org/10.1007/s12351-016-0261-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-016-0261-x

Keywords

Search

Navigation