Skip to main content
Top
Published in: Soft Computing 22/2019

23-01-2019 | Methodologies and Application

Meta-heuristic algorithms for a clustering-based fuzzy bi-criteria hybrid flow shop scheduling problem

Authors: Fatemeh Pourdehghan Golneshini, Hamed Fazlollahtabar

Published in: Soft Computing | Issue 22/2019

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This paper deals with hybrid flow shop scheduling problem with unrelated and eligible machines along with fuzzy processing times and fuzzy due dates. The objective is to minimize a linear combination of total completion time and maximum lateness of jobs. A mixed integer mathematical model is presented for the problem. The most challenging parts of hybrid evolutionary algorithms are determination of efficient strategies by which the whole search space is explored to perform local search around the promising search areas. In this study, a clustering-based approach as a data mining tool is introduced to identify the promising search areas. A repetitive clustering with an evolutionary algorithm is simultaneously employed to determine more promising parts of the solution space. Then, the searches in those parts are intensified with a local search. Here, two clustering-based meta-heuristic algorithms are applied to solve the problem, namely particle swarm optimization and genetic algorithm. The parameters are tuned by Taguchi experimental design, and various randomly generated test problems are used to evaluate the efficiency of the proposed algorithms.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
go back to reference Amin-Naseri MR, Beheshti-Nia MA (2009) Hybrid flow shop scheduling with parallel batching. Int J Prod Econ 117(1):185–196CrossRef Amin-Naseri MR, Beheshti-Nia MA (2009) Hybrid flow shop scheduling with parallel batching. Int J Prod Econ 117(1):185–196CrossRef
go back to reference Arqub OA (2017) Adaptation of reproducing kernel algorithm for solving fuzzy Fredholm–Volterra integrodifferential equations. Neural Comput Appl 28(7):1591–1610CrossRef Arqub OA (2017) Adaptation of reproducing kernel algorithm for solving fuzzy Fredholm–Volterra integrodifferential equations. Neural Comput Appl 28(7):1591–1610CrossRef
go back to reference Arqub OA, Abo-Hammour Z (2014) Numerical solution of systems of second-order boundary value problems using continuous genetic algorithm. Inf Sci 279:396–415MathSciNetMATHCrossRef Arqub OA, Abo-Hammour Z (2014) Numerical solution of systems of second-order boundary value problems using continuous genetic algorithm. Inf Sci 279:396–415MathSciNetMATHCrossRef
go back to reference Arqub OA, AL-Smadi M, Momani S, Hayat T (2016) Numerical solutions of fuzzy differential equations using reproducing kernel Hilbert space method. Soft Comput 20(8):3283–3302MATHCrossRef Arqub OA, AL-Smadi M, Momani S, Hayat T (2016) Numerical solutions of fuzzy differential equations using reproducing kernel Hilbert space method. Soft Comput 20(8):3283–3302MATHCrossRef
go back to reference Arqub OA, AL-Smadi M, Momani S, Hayat T (2017) Application of reproducing kernel algorithm for solving second-order, two-point fuzzy boundary value problems. Soft Comput 21(23):7191–7206MATHCrossRef Arqub OA, AL-Smadi M, Momani S, Hayat T (2017) Application of reproducing kernel algorithm for solving second-order, two-point fuzzy boundary value problems. Soft Comput 21(23):7191–7206MATHCrossRef
go back to reference Arthanary TS, Ramamurthy KG (1971) An extension of two machine sequencing problems. Oper Res 8:10–22MathSciNet Arthanary TS, Ramamurthy KG (1971) An extension of two machine sequencing problems. Oper Res 8:10–22MathSciNet
go back to reference Asadi H (2017) Apply fuzzy learning effect with fuzzy processing times for single machine scheduling problems. J Manuf Syst 42:244–261CrossRef Asadi H (2017) Apply fuzzy learning effect with fuzzy processing times for single machine scheduling problems. J Manuf Syst 42:244–261CrossRef
go back to reference Balin S (2012) Non-identical parallel machine scheduling with fuzzy processing times using genetic algorithm and simulation. Int J Adv Manuf Technol 61(9–12):1115–1127CrossRef Balin S (2012) Non-identical parallel machine scheduling with fuzzy processing times using genetic algorithm and simulation. Int J Adv Manuf Technol 61(9–12):1115–1127CrossRef
go back to reference Bean JC (1993) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6(2):154–161MATHCrossRef Bean JC (1993) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6(2):154–161MATHCrossRef
go back to reference Behnamian J, Zandieh M (2013) Earliness and tardiness minimizing on a realistic hybrid flowshop scheduling with learning effect by advanced metaheuristic. Arab J Sci Eng 38(5):1229–1242MathSciNetCrossRef Behnamian J, Zandieh M (2013) Earliness and tardiness minimizing on a realistic hybrid flowshop scheduling with learning effect by advanced metaheuristic. Arab J Sci Eng 38(5):1229–1242MathSciNetCrossRef
go back to reference Bezdek J, Ehrlich R, Full W (1984) FCM: the fuzzy c-means clustering algorithm. Comput Geosci 10(2–3):191–203CrossRef Bezdek J, Ehrlich R, Full W (1984) FCM: the fuzzy c-means clustering algorithm. Comput Geosci 10(2–3):191–203CrossRef
go back to reference Choi SH, Wang K (2012) Flexible flow shop scheduling with stochastic processing times: a decomposition-based approach. Comput Ind Eng 63(2):362–373CrossRef Choi SH, Wang K (2012) Flexible flow shop scheduling with stochastic processing times: a decomposition-based approach. Comput Ind Eng 63(2):362–373CrossRef
go back to reference Dugardin F, Yalaoui F, Amodeo L (2010) New multi-objective method to solve reentrant hybrid flow shop scheduling problem. Eur J Oper Res 203(1):22–31MathSciNetMATHCrossRef Dugardin F, Yalaoui F, Amodeo L (2010) New multi-objective method to solve reentrant hybrid flow shop scheduling problem. Eur J Oper Res 203(1):22–31MathSciNetMATHCrossRef
go back to reference Ebrahimi M, Fatemi Ghomi SMT, Karimi B (2013) Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates. Appl Math Model 38(9–10):2490–2504MathSciNetMATH Ebrahimi M, Fatemi Ghomi SMT, Karimi B (2013) Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates. Appl Math Model 38(9–10):2490–2504MathSciNetMATH
go back to reference Eddaly M, Jarboui B, Siarry P (2016) Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem. J Comput Des Eng 3(4):295–311 Eddaly M, Jarboui B, Siarry P (2016) Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem. J Comput Des Eng 3(4):295–311
go back to reference Engin O, Ceran G, Yilmaz M (2011) An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems. Appl Soft Comput 11(3):3056–3065CrossRef Engin O, Ceran G, Yilmaz M (2011) An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems. Appl Soft Comput 11(3):3056–3065CrossRef
go back to reference Eren T, Guner E (2006) A bicriteria flowshop scheduling problem with setup times. Appl Math Comput 183:1292–1300MathSciNetMATH Eren T, Guner E (2006) A bicriteria flowshop scheduling problem with setup times. Appl Math Comput 183:1292–1300MathSciNetMATH
go back to reference Fadaei M, Zandieh M (2013) Scheduling a bi-objective hybrid flow shop with sequence-dependent family setup times using metaheuristics. Arab J Sci Eng 38(8):2233–2244CrossRef Fadaei M, Zandieh M (2013) Scheduling a bi-objective hybrid flow shop with sequence-dependent family setup times using metaheuristics. Arab J Sci Eng 38(8):2233–2244CrossRef
go back to reference Figielska E (2014) A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages. Eur J Oper Res 236(2):433–444MathSciNetMATHCrossRef Figielska E (2014) A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages. Eur J Oper Res 236(2):433–444MathSciNetMATHCrossRef
go back to reference Filho GR, Nagano MS, Lorena LAN (2007) Evolutionary clustering search for flowtime minimization in permutation flow shop. Springer, Berlin, pp 69–81 Filho GR, Nagano MS, Lorena LAN (2007) Evolutionary clustering search for flowtime minimization in permutation flow shop. Springer, Berlin, pp 69–81
go back to reference Gao KZ, Suganthan PN, Pan QK, Chua TJ, Chong CH, Cai TX (2016) An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time. Expert Syst Appl 65:52–67CrossRef Gao KZ, Suganthan PN, Pan QK, Chua TJ, Chong CH, Cai TX (2016) An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time. Expert Syst Appl 65:52–67CrossRef
go back to reference Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI
go back to reference Javadi B, Saidi-Mehrabad M, Haji A, Mahdavi I, Jolai F, Mahdavi-Amiri N (2008) No-wait flow shop scheduling using fuzzy multi-objective linear programming. J Frankl Inst 345(5):452–467MATHCrossRef Javadi B, Saidi-Mehrabad M, Haji A, Mahdavi I, Jolai F, Mahdavi-Amiri N (2008) No-wait flow shop scheduling using fuzzy multi-objective linear programming. J Frankl Inst 345(5):452–467MATHCrossRef
go back to reference Jian Y, Qiansheng C (2001) The upper bound of the optimal number of clusters in fuzzy clustering. Sci China Ser F Inf Sci 44(2):119–125 Jian Y, Qiansheng C (2001) The upper bound of the optimal number of clusters in fuzzy clustering. Sci China Ser F Inf Sci 44(2):119–125
go back to reference Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Q 1(1):61–80MATHCrossRef Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Q 1(1):61–80MATHCrossRef
go back to reference Kahraman C, Engin O, Kaya I, Yilmaz MK (2008) An application of effective genetic algorithm for solving hybrid flow shop scheduling problems. Int J Comput Intell Syst 1(2):134–147CrossRef Kahraman C, Engin O, Kaya I, Yilmaz MK (2008) An application of effective genetic algorithm for solving hybrid flow shop scheduling problems. Int J Comput Intell Syst 1(2):134–147CrossRef
go back to reference Kennedy J, Eberhart RC (1995) Particle swarm optimization. Proc IEEE Int Conf Neural Netw 4:1942–1948CrossRef Kennedy J, Eberhart RC (1995) Particle swarm optimization. Proc IEEE Int Conf Neural Netw 4:1942–1948CrossRef
go back to reference Khademi-Zare H, Fakhrzad MB (2011) Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: a fuzzy approach. Expert Syst Appl 38(6):7609–7615CrossRef Khademi-Zare H, Fakhrzad MB (2011) Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: a fuzzy approach. Expert Syst Appl 38(6):7609–7615CrossRef
go back to reference Khalouli S, Ghedjati F, Hamzaoui A (2010) A meta-heuristic approach to solve a JIT scheduling problem in a hybrid flow shop. Eng Appl Artif Intell 23(5):765–771CrossRef Khalouli S, Ghedjati F, Hamzaoui A (2010) A meta-heuristic approach to solve a JIT scheduling problem in a hybrid flow shop. Eng Appl Artif Intell 23(5):765–771CrossRef
go back to reference Liu GS, Zhou Y, Yang HD (2017) Minimizing energy consumption and tardiness penalty for fuzzy flowshop scheduling with state-dependent setup time. J Clean Prod 147:470–484CrossRef Liu GS, Zhou Y, Yang HD (2017) Minimizing energy consumption and tardiness penalty for fuzzy flowshop scheduling with state-dependent setup time. J Clean Prod 147:470–484CrossRef
go back to reference Low C, Hsu C-J, Su C-T (2008) A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated machines. Comput Oper Res 35(3):845–853MathSciNetMATHCrossRef Low C, Hsu C-J, Su C-T (2008) A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated machines. Comput Oper Res 35(3):845–853MathSciNetMATHCrossRef
go back to reference Mahdavi I, Zarezadeh V, Shahnazari-Shahrezaei P (2011) Flexible flowshop scheduling with equal number of unrelated parallel machines. J Ind Eng Int 7(13):74–83 Mahdavi I, Zarezadeh V, Shahnazari-Shahrezaei P (2011) Flexible flowshop scheduling with equal number of unrelated parallel machines. J Ind Eng Int 7(13):74–83
go back to reference Marichelvam MK, Prabaharan T, Yang XX (2014) Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan. Appl Soft Comput 19:93–101CrossRef Marichelvam MK, Prabaharan T, Yang XX (2014) Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan. Appl Soft Comput 19:93–101CrossRef
go back to reference Marichelvam MK, Tosun O, Geetha M (2017) Hybrid monkey search algorithm for flow shop scheduling problem under makespan and total flow time. Appl Soft Comput 55:82–92CrossRef Marichelvam MK, Tosun O, Geetha M (2017) Hybrid monkey search algorithm for flow shop scheduling problem under makespan and total flow time. Appl Soft Comput 55:82–92CrossRef
go back to reference Mehrjerdi YZ, Ghasemi Gajvan AA, Shah Mohammadi M (2014) A bi-criterion hybrid flow shop time scheduling: balancing the performance and total completion times. Int J Ind Eng Prod Manag 24(4):475–488 Mehrjerdi YZ, Ghasemi Gajvan AA, Shah Mohammadi M (2014) A bi-criterion hybrid flow shop time scheduling: balancing the performance and total completion times. Int J Ind Eng Prod Manag 24(4):475–488
go back to reference Mirsanei HS, Zandieh M, Moayed MJ (2011) A simulated annealing algorithm to hybrid flow shop scheduling with sequence-dependent setup times. J Intell Manuf 22(6):965–978CrossRef Mirsanei HS, Zandieh M, Moayed MJ (2011) A simulated annealing algorithm to hybrid flow shop scheduling with sequence-dependent setup times. J Intell Manuf 22(6):965–978CrossRef
go back to reference Mousavai SM, Zandieh M, Yazdani M (2013) A simulated annealing/local search to minimize the makespan and total tardiness on a hybrid flowshop. Int J Adv Manuf Technol 64(1):369–388CrossRef Mousavai SM, Zandieh M, Yazdani M (2013) A simulated annealing/local search to minimize the makespan and total tardiness on a hybrid flowshop. Int J Adv Manuf Technol 64(1):369–388CrossRef
go back to reference Naderi B, Fatemi Ghomi SMT, Aminnayeri M (2010) A high performing metaheuristic for job shop scheduling with sequence-dependent setup times. Appl Soft Comput 10:703–710CrossRef Naderi B, Fatemi Ghomi SMT, Aminnayeri M (2010) A high performing metaheuristic for job shop scheduling with sequence-dependent setup times. Appl Soft Comput 10:703–710CrossRef
go back to reference Nagano SN, Silva AAD, Lorena LAN (2014) A new evolutionary clustering search for a no-wait flow shop problem with set-up times. Eng Appl Artif Intell 25(6):1114–1120CrossRef Nagano SN, Silva AAD, Lorena LAN (2014) A new evolutionary clustering search for a no-wait flow shop problem with set-up times. Eng Appl Artif Intell 25(6):1114–1120CrossRef
go back to reference Noori-Darvish S, Mahdavi I, Mahdavi-Amiri N (2012) A bi-objective possibilistic programming model for open shop scheduling problems with sequence-dependent setup times, fuzzy processing times, and fuzzy due dates. Appl Soft Comput J 12(4):1399–1416CrossRef Noori-Darvish S, Mahdavi I, Mahdavi-Amiri N (2012) A bi-objective possibilistic programming model for open shop scheduling problems with sequence-dependent setup times, fuzzy processing times, and fuzzy due dates. Appl Soft Comput J 12(4):1399–1416CrossRef
go back to reference Oliveira ACM, Lorena LAN (2004) Detecting promising areas by evolutionary clustering search. Advances in Artificial Intelligence, pp. 385-394CrossRef Oliveira ACM, Lorena LAN (2004) Detecting promising areas by evolutionary clustering search. Advances in Artificial Intelligence, pp. 385-394CrossRef
go back to reference Portmann MC, Vignier A, Dardilhac D, Dezalay D (1998) Branch and bound crossed with GA to solve hybrid flowshops. Eur J Oper Res 107(2):389–400MATHCrossRef Portmann MC, Vignier A, Dardilhac D, Dezalay D (1998) Branch and bound crossed with GA to solve hybrid flowshops. Eur J Oper Res 107(2):389–400MATHCrossRef
go back to reference Ribas I, Leisten R, Framiñan JM (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput Oper Res 37(8):1439–1454MathSciNetMATHCrossRef Ribas I, Leisten R, Framiñan JM (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput Oper Res 37(8):1439–1454MathSciNetMATHCrossRef
go back to reference Ruiz R, Vazquez-Rodriguez JA (2010) Invited review: the hybrid flow shop scheduling problem. Eur J Oper Res 205(1):1–18MATHCrossRef Ruiz R, Vazquez-Rodriguez JA (2010) Invited review: the hybrid flow shop scheduling problem. Eur J Oper Res 205(1):1–18MATHCrossRef
go back to reference Tavakkoli-Moghaddam R, Javadi B, Jolai F, Ghodratnam A (2010) The use of a fuzzy multi-objective linear programming for solving a multi objective single-machine scheduling problem. Appl Soft Comput J 10(3):919–925CrossRef Tavakkoli-Moghaddam R, Javadi B, Jolai F, Ghodratnam A (2010) The use of a fuzzy multi-objective linear programming for solving a multi objective single-machine scheduling problem. Appl Soft Comput J 10(3):919–925CrossRef
go back to reference Wang SJ, Liu M (2013b) A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem. Comput Oper Res 40(4):1064–1075MathSciNetMATHCrossRef Wang SJ, Liu M (2013b) A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem. Comput Oper Res 40(4):1064–1075MathSciNetMATHCrossRef
go back to reference Wang SJ, Liu M (2014) Two-stage hybrid flow shop scheduling with preventive maintenance using multi-objective tabu search method. Int J Prod Res 52(5):1495–1508CrossRef Wang SJ, Liu M (2014) Two-stage hybrid flow shop scheduling with preventive maintenance using multi-objective tabu search method. Int J Prod Res 52(5):1495–1508CrossRef
go back to reference Wang HM, Chou FD, Wu FC (2011) A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan. Int J Adv Manuf Technol 53(5–8):761–776CrossRef Wang HM, Chou FD, Wu FC (2011) A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan. Int J Adv Manuf Technol 53(5–8):761–776CrossRef
go back to reference Warren Liao T, Su P (2017) Parallel machine scheduling in fuzzy environment with hybrid ant colony optimization including a comparison of fuzzy number ranking methods in consideration of spread of fuzziness. Appl Soft Comput 56:65–81CrossRef Warren Liao T, Su P (2017) Parallel machine scheduling in fuzzy environment with hybrid ant colony optimization including a comparison of fuzzy number ranking methods in consideration of spread of fuzziness. Appl Soft Comput 56:65–81CrossRef
go back to reference Woo YB, 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–190CrossRef Woo YB, 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–190CrossRef
go back to reference Wu HC (2010) Solving the fuzzy earliness and tardiness in scheduling problems by using genetic algorithms. Expert Syst Appl 37(7):4860–4866CrossRef Wu HC (2010) Solving the fuzzy earliness and tardiness in scheduling problems by using genetic algorithms. Expert Syst Appl 37(7):4860–4866CrossRef
go back to reference Zandieh M, Fatemi Ghomi SMT, Moattar Husseini SM (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Appl Math Comput 180(1):111–127MathSciNetMATH Zandieh M, Fatemi Ghomi SMT, Moattar Husseini SM (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Appl Math Comput 180(1):111–127MathSciNetMATH
go back to reference Ziaeifar A, Tavakkoli-Moghaddam R, Pichka K (2012) Solving a new mathematical model for a hybrid flow shop scheduling problem with a processor assignment by a genetic algorithm. Int J Adv Manuf Technol 61(1–4):339–349CrossRef Ziaeifar A, Tavakkoli-Moghaddam R, Pichka K (2012) Solving a new mathematical model for a hybrid flow shop scheduling problem with a processor assignment by a genetic algorithm. Int J Adv Manuf Technol 61(1–4):339–349CrossRef
Metadata
Title
Meta-heuristic algorithms for a clustering-based fuzzy bi-criteria hybrid flow shop scheduling problem
Authors
Fatemeh Pourdehghan Golneshini
Hamed Fazlollahtabar
Publication date
23-01-2019
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 22/2019
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-019-03767-0

Other articles of this Issue 22/2019

Soft Computing 22/2019 Go to the issue

Premium Partner