@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}},
}

@article{53987,
  author       = {{Toloo, Mehdi and Tavana, Madjid and Santos-Arteaga, Francisco J.}},
  issn         = {{1435-246X}},
  journal      = {{Central European Journal of Operations Research}},
  number       = {{4}},
  pages        = {{887--904}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{An integrated data envelopment analysis and mixed integer non-linear programming model for linearizing the common set of weights}}},
  doi          = {{10.1007/s10100-017-0510-y}},
  volume       = {{27}},
  year         = {{2019}},
}

@article{53976,
  author       = {{Mousavi, Seyed Mohsen and Tavana, Madjid and Alikar, Najmeh and Zandieh, Mostafa}},
  issn         = {{0941-0643}},
  journal      = {{Neural Computing and Applications}},
  number       = {{3}},
  pages        = {{873--885}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{A tuned hybrid intelligent fruit fly optimization algorithm for fuzzy rule generation and classification}}},
  doi          = {{10.1007/s00521-017-3115-4}},
  volume       = {{31}},
  year         = {{2019}},
}

@article{53988,
  author       = {{Ebrahimnejad, Ali and Tavana, Madjid and Nasseri, Seyed Hadi and Gholami, Omid}},
  issn         = {{0219-6220}},
  journal      = {{International Journal of Information Technology &amp; Decision Making}},
  number       = {{01}},
  pages        = {{147--170}},
  publisher    = {{World Scientific Pub Co Pte Lt}},
  title        = {{{A New Method for Solving Dual DEA Problems with Fuzzy Stochastic Data}}},
  doi          = {{10.1142/s0219622018500396}},
  volume       = {{18}},
  year         = {{2019}},
}

@article{53965,
  author       = {{Tavana, Madjid and Khalili-Damghani, Kaveh and Santos Arteaga, Francisco J. and Hosseini, Amineh}},
  issn         = {{0360-8352}},
  journal      = {{Computers & Industrial Engineering}},
  pages        = {{143--155}},
  publisher    = {{Elsevier BV}},
  title        = {{{A fuzzy multi-objective multi-period network DEA model for efficiency measurement in oil refineries}}},
  doi          = {{10.1016/j.cie.2019.05.033}},
  volume       = {{135}},
  year         = {{2019}},
}

@article{53978,
  author       = {{Di Caprio, Debora and Santos-Arteaga, Francisco J. and Tavana, Madjid}},
  issn         = {{2214-7160}},
  journal      = {{Operations Research Perspectives}},
  publisher    = {{Elsevier BV}},
  title        = {{{The role of anticipated emotions and the value of information in determining sequential search incentives}}},
  doi          = {{10.1016/j.orp.2019.100106}},
  volume       = {{6}},
  year         = {{2019}},
}

@article{53986,
  author       = {{Asadi Bagloee, Saeed and Tavana, Madjid and Withers, Glenn and Patriksson, Michael and Asadi, Mohsen}},
  issn         = {{2542-6605}},
  journal      = {{Internet of Things}},
  publisher    = {{Elsevier BV}},
  title        = {{{Tradable mobility permit with Bitcoin and Ethereum – A Blockchain application in transportation}}},
  doi          = {{10.1016/j.iot.2019.100103}},
  volume       = {{8}},
  year         = {{2019}},
}

@article{53977,
  author       = {{Razavi Hajiagha, Seyed Hossein and Amoozad Mahdiraji, Hannan and Tavana, Madjid}},
  issn         = {{0263-2241}},
  journal      = {{Measurement}},
  publisher    = {{Elsevier BV}},
  title        = {{{A new bi-level data envelopment analysis model for efficiency measurement and target setting}}},
  doi          = {{10.1016/j.measurement.2019.106877}},
  volume       = {{147}},
  year         = {{2019}},
}

@article{53989,
  author       = {{Aghayi, NAZILA and Tavana, Madjid and Maleki, Bentolhoda}},
  issn         = {{2345-3605}},
  journal      = {{Scientia Iranica}},
  pages        = {{0--0}},
  publisher    = {{SciTech Solutions}},
  title        = {{{A Malmquist Productivity Index with Directional Distance Function and Uncertain Data}}},
  doi          = {{10.24200/sci.2018.5259.1173}},
  year         = {{2019}},
}

@article{53991,
  author       = {{-, Shashi and Tavana, Madjid and Shabani, Amir and Singh, Rajwinder}},
  journal      = {{Journal of Industrial Engineering International}},
  number       = {{Suppl 1}},
  pages        = {{39--51}},
  title        = {{{The impact of interwoven integration practices on supply chain value addition and firm performance}}},
  doi          = {{https://doi.org/10.1007/s40092-019-0316-8}},
  volume       = {{15}},
  year         = {{2019}},
}

@article{53974,
  author       = {{Mousavi, Seyed Mohsen and Alikar, Najmeh and Tavana, Madjid and Di Caprio, Debora}},
  issn         = {{0956-5515}},
  journal      = {{Journal of Intelligent Manufacturing}},
  number       = {{3}},
  pages        = {{1175--1194}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{An improved particle swarm optimization model for solving homogeneous discounted series-parallel redundancy allocation problems}}},
  doi          = {{10.1007/s10845-017-1311-9}},
  volume       = {{30}},
  year         = {{2019}},
}

@article{53971,
  author       = {{Zare, Habib and Tavana, Madjid and Mardani, Abbas and Masoudian, Sepideh and Kamali Saraji, Mahyar}},
  issn         = {{1386-9620}},
  journal      = {{Health Care Management Science}},
  number       = {{3}},
  pages        = {{475--488}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{A hybrid data envelopment analysis and game theory model for performance measurement in healthcare}}},
  doi          = {{10.1007/s10729-018-9456-4}},
  volume       = {{22}},
  year         = {{2019}},
}

@article{53967,
  author       = {{Santos Arteaga, Francisco J. and Tavana, Madjid and Di Caprio, Debora and Toloo, Mehdi}},
  issn         = {{0377-2217}},
  journal      = {{European Journal of Operational Research}},
  number       = {{2}},
  pages        = {{448--462}},
  publisher    = {{Elsevier BV}},
  title        = {{{A dynamic multi-stage slacks-based measure data envelopment analysis model with knowledge accumulation and technological evolution}}},
  doi          = {{10.1016/j.ejor.2018.09.008}},
  volume       = {{278}},
  year         = {{2019}},
}

@article{53972,
  author       = {{Santos-Arteaga, Francisco J. and Torrecillas, Celia and Tavana, Madjid}},
  issn         = {{0892-9912}},
  journal      = {{The Journal of Technology Transfer}},
  number       = {{1}},
  pages        = {{97--131}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Dynamic effects of learning on the innovative outputs and productivity in Spanish multinational enterprises}}},
  doi          = {{10.1007/s10961-017-9597-5}},
  volume       = {{44}},
  year         = {{2019}},
}

