@article{53901,
  author       = {{Tavana, Madjid and Hajipour, Vahid}},
  issn         = {{1463-5771}},
  journal      = {{Benchmarking: An International Journal}},
  number       = {{1}},
  pages        = {{81--136}},
  publisher    = {{Emerald}},
  title        = {{{A practical review and taxonomy of fuzzy expert systems: methods and applications}}},
  doi          = {{10.1108/bij-04-2019-0178}},
  volume       = {{27}},
  year         = {{2020}},
}

@article{53890,
  author       = {{Kaviani, Mohamad Amin and Tavana, Madjid and Kumar, Anil and Michnik, Jerzy and Niknam, Raziyeh and Campos, Elaine Aparecida Regiani de}},
  issn         = {{0959-6526}},
  journal      = {{Journal of Cleaner Production}},
  publisher    = {{Elsevier BV}},
  title        = {{{An integrated framework for evaluating the barriers to successful implementation of reverse logistics in the automotive industry}}},
  doi          = {{10.1016/j.jclepro.2020.122714}},
  volume       = {{272}},
  year         = {{2020}},
}

@article{53894,
  author       = {{Hashemi Petrudi, Seyed Hamid and Tavana, Madjid and Abdi, Mehdi}},
  issn         = {{2212-4209}},
  journal      = {{International Journal of Disaster Risk Reduction}},
  publisher    = {{Elsevier BV}},
  title        = {{{A comprehensive framework for analyzing challenges in humanitarian supply chain management: A case study of the Iranian Red Crescent Society}}},
  doi          = {{10.1016/j.ijdrr.2019.101340}},
  volume       = {{42}},
  year         = {{2020}},
}

@article{53889,
  author       = {{Farughi, Hiwa and Tavana, Madjid and Mostafayi, Sobhan and Santos Arteaga, Francisco J.}},
  issn         = {{0160-5682}},
  journal      = {{Journal of the Operational Research Society}},
  number       = {{11}},
  pages        = {{1740--1759}},
  publisher    = {{Informa UK Limited}},
  title        = {{{A novel optimization model for designing compact, balanced, and contiguous healthcare districts}}},
  doi          = {{10.1080/01605682.2019.1621217}},
  volume       = {{71}},
  year         = {{2020}},
}

@article{53891,
  author       = {{Yazdani, Morteza and Tavana, Madjid and Pamučar, Dragan and Chatterjee, Prasenjit}},
  issn         = {{0360-8352}},
  journal      = {{Computers &amp; Industrial Engineering}},
  publisher    = {{Elsevier BV}},
  title        = {{{A rough based multi-criteria evaluation method for healthcare waste disposal location decisions}}},
  doi          = {{10.1016/j.cie.2020.106394}},
  volume       = {{143}},
  year         = {{2020}},
}

@article{53896,
  author       = {{Khanjani Shiraz, Rashed and Tavana, Madjid and Fukuyama, Hirofumi}},
  issn         = {{1432-7643}},
  journal      = {{Soft Computing}},
  number       = {{22}},
  pages        = {{17167--17186}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{A random-fuzzy portfolio selection DEA model using value-at-risk and conditional value-at-risk}}},
  doi          = {{10.1007/s00500-020-05010-7}},
  volume       = {{24}},
  year         = {{2020}},
}

@article{53895,
  author       = {{Ebrahimi, Bohlool and Dellnitz, Andreas and Kleine, Andreas and Tavana, Madjid}},
  issn         = {{0957-4174}},
  journal      = {{Expert Systems with Applications}},
  publisher    = {{Elsevier BV}},
  title        = {{{A novel method for solving data envelopment analysis problems with weak ordinal data using robust measures}}},
  doi          = {{10.1016/j.eswa.2020.113835}},
  volume       = {{164}},
  year         = {{2020}},
}

@article{53893,
  author       = {{Ebrahimi, Bohlool and Tavana, Madjid and Toloo, Mehdi and Charles, Vincent}},
  issn         = {{0360-8352}},
  journal      = {{Computers & Industrial Engineering}},
  publisher    = {{Elsevier BV}},
  title        = {{{A novel mixed binary linear DEA model for ranking decision-making units with preference information}}},
  doi          = {{10.1016/j.cie.2020.106720}},
  volume       = {{149}},
  year         = {{2020}},
}

@article{53897,
  author       = {{Zaretalab, Arash and Hajipour, Vahid and Tavana, Madjid}},
  issn         = {{0951-8320}},
  journal      = {{Reliability Engineering & System Safety}},
  publisher    = {{Elsevier BV}},
  title        = {{{Redundancy allocation problem with multi-state component systems and reliable supplier selection}}},
  doi          = {{10.1016/j.ress.2019.106629}},
  volume       = {{193}},
  year         = {{2020}},
}

@article{53892,
  author       = {{Santos-Arteaga, Francisco J. and Tavana, Madjid and Di Caprio, Debora}},
  issn         = {{0957-4174}},
  journal      = {{Expert Systems with Applications}},
  publisher    = {{Elsevier BV}},
  title        = {{{A new model for evaluating subjective online ratings with uncertain intervals}}},
  doi          = {{10.1016/j.eswa.2019.112850}},
  volume       = {{139}},
  year         = {{2020}},
}

@article{53888,
  author       = {{Vafadarnikjoo, Amin and Tavana, Madjid and Botelho, Tiago and Chalvatzis, Konstantinos}},
  issn         = {{0254-5330}},
  journal      = {{Annals of Operations Research}},
  number       = {{2}},
  pages        = {{391--418}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{A neutrosophic enhanced best–worst method for considering decision-makers’ confidence in the best and worst criteria}}},
  doi          = {{10.1007/s10479-020-03603-x}},
  volume       = {{289}},
  year         = {{2020}},
}

@article{53884,
  author       = {{Tavana, Madjid and Khalili-Damghani, Kaveh and Santos Arteaga, Francisco J. and Hashemi, Arousha}},
  issn         = {{0254-5330}},
  journal      = {{Annals of Operations Research}},
  number       = {{1}},
  pages        = {{415--445}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{A Malmquist productivity index for network production systems in the energy sector}}},
  doi          = {{10.1007/s10479-019-03173-7}},
  volume       = {{284}},
  year         = {{2020}},
}

@article{53885,
  author       = {{Tavana, Madjid and Mousavi, Sayed Mohammad Hossein and Mina, Hassan and Salehian, Farhad}},
  issn         = {{0278-4319}},
  journal      = {{International Journal of Hospitality Management}},
  publisher    = {{Elsevier BV}},
  title        = {{{A dynamic decision support system for evaluating peer-to-peer rental accommodations in the sharing economy}}},
  doi          = {{10.1016/j.ijhm.2020.102653}},
  volume       = {{91}},
  year         = {{2020}},
}

@article{53887,
  author       = {{Jafarian, Ahmad and Rabiee, Meysam and Tavana, Madjid}},
  issn         = {{0925-5273}},
  journal      = {{International Journal of Production Economics}},
  publisher    = {{Elsevier BV}},
  title        = {{{A novel multi-objective co-evolutionary approach for supply chain gap analysis with consideration of uncertainties}}},
  doi          = {{10.1016/j.ijpe.2020.107852}},
  volume       = {{228}},
  year         = {{2020}},
}

@article{53886,
  author       = {{Tavana, Madjid and Khosrojerdi, Ghasem and Mina, Hassan and Rahman, Amirah}},
  issn         = {{0360-8352}},
  journal      = {{Computers & Industrial Engineering}},
  publisher    = {{Elsevier BV}},
  title        = {{{A new dynamic two-stage mathematical programming model under uncertainty for project evaluation and selection}}},
  doi          = {{10.1016/j.cie.2020.106795}},
  volume       = {{149}},
  year         = {{2020}},
}

@article{5674,
  abstract     = {{In disaster operations management, a challenging task for rescue organizations occurs when they have to assign and schedule their rescue units to emerging incidents under time pressure in order to reduce the overall resulting harm. Of particular importance in practical scenarios is the need to consider collaboration of rescue units. This task has hardly been addressed in the literature. We contribute to both modeling and solving this problem by (1) conceptualizing the situation as a type of scheduling problem, (2) modeling it as a binary linear minimization problem, (3) suggesting a branch-and-price algorithm, which can serve as both an exact and heuristic solution procedure, and (4) conducting computational experiments - including a sensitivity analysis of the effects of exogenous model parameters on execution times and objective value improvements over a heuristic suggested in the literature - for different practical disaster scenarios. The results of our computational experiments show that most problem instances of practically feasible size can be solved to optimality within ten minutes. Furthermore, even when our algorithm is terminated once the first feasible solution has been found, this solution is in almost all cases competitive to the optimal solution and substantially better than the solution obtained by the best known algorithm from the literature. This performance of our branch-and-price algorithm enables rescue organizations to apply our procedure in practice, even when the time for decision making is limited to a few minutes. By addressing a very general type of scheduling problem, our approach applies to various scheduling situations.}},
  author       = {{Rauchecker, Gerhard and Schryen, Guido}},
  journal      = {{European Journal of Operational Research}},
  keywords     = {{OR in disaster relief, disaster operations management, scheduling, branch-and-price}},
  number       = {{1}},
  pages        = {{352 -- 363}},
  publisher    = {{Elsevier}},
  title        = {{{An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response}}},
  volume       = {{272}},
  year         = {{2019}},
}

@article{6512,
  abstract     = {{Scheduling problems are essential for decision making in many academic disciplines, including operations management, computer science, and information systems. Since many scheduling problems are NP-hard in the strong sense, there is only limited research on exact algorithms and how their efficiency scales when implemented on parallel computing architectures. We address this gap by (1) adapting an exact branch-and-price algorithm to a parallel machine scheduling problem on unrelated machines with sequence- and machine-dependent setup times, (2) parallelizing the adapted algorithm by implementing a distributed-memory parallelization with a master/worker approach, and (3) conducting extensive computational experiments using up to 960 MPI processes on a modern high performance computing cluster. With our experiments, we show that the efficiency of our parallelization approach can lead to superlinear speedup but can vary substantially between instances. We further show that the wall time of serial execution can be substantially reduced through our parallelization, in some cases from 94 hours to less than six minutes when our algorithm is executed on 960 processes.}},
  author       = {{Rauchecker, Gerhard and Schryen, Guido}},
  journal      = {{Computers & Operations Research}},
  keywords     = {{parallel machine scheduling with setup times, parallel branch-and-price algorithm, high performance computing, master/worker parallelization}},
  number       = {{104}},
  pages        = {{338--357}},
  publisher    = {{Elsevier}},
  title        = {{{Using High Performance Computing for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times: Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm}}},
  year         = {{2019}},
}

@inproceedings{6514,
  abstract     = {{Recommender Agents (RAs) facilitate consumers’ online purchase decisions for complex, multi-attribute products. As not all combinations of attribute levels can be obtained, users are forced into trade-offs. The exposure of trade-offs in a RA has been found to affect consumers’ perceptions. However, little is known about how different preference elicitation methods in RAs affect consumers by varying degrees of trade-off exposure. We propose a research model that investigates how different levels of trade-off exposure cognitively and affectively influence consumers’ satisfaction with RAs. We operationalize these levels in three different RA types and test our hypotheses in a laboratory experiment with 116 participants. Our results indicate that with increasing tradeoff exposure, perceived enjoyment and perceived control follow an inverted Ushaped relationship. Hence, RAs using preference elicitation methods with medium trade-off exposure yield highest consumer satisfaction. This contributes to the understanding of trade-offs in RAs and provides valuable implications to e-commerce practitioners.}},
  author       = {{Schuhbeck, Veronika and Siegfried, Nils and Dorner, Verena and Benlian, Alexander and Scholz, Michael and Schryen, Guido}},
  booktitle    = {{Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik}},
  keywords     = {{Recommender Agents, Preference Elicitation Method, Trade-off Exposure, Customer Satisfaction}},
  location     = {{Siegen, Germany}},
  pages        = {{55--64}},
  title        = {{{Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents}}},
  year         = {{2019}},
}

@inbook{14890,
  author       = {{Kuhlemann, Stefan and Sellmann, Meinolf and Tierney, Kevin}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783030300470}},
  issn         = {{0302-9743}},
  title        = {{{Exploiting Counterfactuals for Scalable Stochastic Optimization}}},
  doi          = {{10.1007/978-3-030-30048-7_40}},
  year         = {{2019}},
}

@article{14540,
  author       = {{Schryen, Guido and Kliewer, Natalia and Borndörfer, Ralf and Koch, Thorsten}},
  journal      = {{OR News}},
  pages        = {{34--35}},
  title        = {{{High-Performance Business Computing – Parallel Algorithms and Implementations for Solving Problems in Operations Research and Data Analysis}}},
  volume       = {{65}},
  year         = {{2019}},
}

