@unpublished{65499,
  abstract     = {{This paper examines whether player-reported workplace quality is associated with team success in the National Football League (NFL). Using panel data for all 32 NFL teams across four seasons (2022-2025), we test whether NFLPA report card rankings-player evaluations of facilities, travel, medical support, coaching, and organizational environment-are related to regular season win percentage. Fixed effects models controlling for player quality, roster composition, injuries, coaching tenure, and past performance reveal a statistically significant within-team association between better player-reported workplace conditions and higher win percentages. However, this relationship does not persist when workplace quality is lagged, suggesting that player evaluations may partly reflect current team performance rather than predict future outcomes. These findings indicate that player evaluations of workplace quality are closely aligned with team success, highlighting the role of perception and short-run performance dynamics in a high-skill labor market setting.}},
  author       = {{Protte, Marius}},
  keywords     = {{NFL team performance, NFLPA report cards, player satisfaction, organizational environment, non-pecuniary compensation}},
  title        = {{{Player-Perceived Workplace Quality and Team Performance: Evidence from NFLPA Report Cards}}},
  year         = {{2026}},
}

@article{32416,
  abstract     = {{In recent years, sequence-defined oligomers (SDOs) gained increasing interest due to their perfectly controlled molecular structure, thus providing defined properties. In order to tune the properties, different functionalities need to be incorporated into the oligomers and the chain tacticity needs to be controlled. Beside the synthesis of SDOs, suitable methods need to be found to analyze the molecular structure. In this work, oligomers exhibiting an alternating or block-wise sequence of side chain functionalities were analyzed using a hyphenation of ultra-high-performance liquid chromatography and electrospray ionization mass spectrometry enhanced by ion mobility separation (IMS). Moieties in the side chains were varied according to polarity and bulkiness. Moreover, chain tacticity was varied. Drift times in the IMS cell and the corresponding collision cross section (CCS) values were shown to be individual parameters allowing the identification of SDOs, even in the case that SDO structures only differ in sequence or tacticity of side chain functionalities. Thus, a library of CCS values was obtained as reference used for the analysis of complex mixtures of SDOs.}},
  author       = {{Berg, Marie-Theres and Herberg, Artjom and Kuckling, Dirk}},
  issn         = {{1023-666X}},
  journal      = {{International Journal of Polymer Analysis and Characterization}},
  keywords     = {{Ultra-high-performance liquid chromatography, ion mobility separation, mass spectrometry, LC-MS hyphenation, sequence-defined oligomers}},
  pages        = {{1--12}},
  publisher    = {{Informa UK Limited}},
  title        = {{{Hyphenation of ultra-high-performance liquid chromatography and ion mobility mass spectrometry for the analysis of sequence-defined oligomers with different functionalities and tacticity}}},
  doi          = {{10.1080/1023666x.2022.2100968}},
  year         = {{2022}},
}

@article{44529,
  abstract     = {{According to the German Rectors’ Conference (HRK), German higher education teaching fails to
meet the demand to integrate competence-oriented learning objectives. Despite a wide-ranging debate on the use of learning objectives, empirical research on their effectiveness is scarce. The present study uses the features of digital teaching platforms to investigate the perception and effectiveness of learning objectives applying a randomised controlled experiment followed by a survey in a course for undergraduate economics students (N = 30). Controlling group preconditions and the treatment effect allows to draw conclusions about the different learning outcomes of the student groups. The specification of behaviour-oriented learning objectives in the online course system leads to significantly better performance in the treatment group. A stronger perception of the learning objectives in the treatment group supports this effect that remains significant in a regression analysis. Thus, the study provides an empirical justification to integrate learning objectives in university teaching.}},
  author       = {{Auer, Thorsten Fabian}},
  issn         = {{2199-8825}},
  journal      = {{die hochschullehre}},
  keywords     = {{learning objectives, academic performance, perception, teaching methods, experiment}},
  number       = {{1}},
  pages        = {{662--675}},
  title        = {{{Die Wirksamkeit von Lernzielen für Studienleistungen – eine experimentelle Studie}}},
  doi          = {{http://doi.org/10.3278/HSL2248W}},
  volume       = {{8}},
  year         = {{2022}},
}

@inproceedings{48882,
  abstract     = {{In multimodal multi-objective optimization (MMMOO), the focus is not solely on convergence in objective space, but rather also on explicitly ensuring diversity in decision space. We illustrate why commonly used diversity measures are not entirely appropriate for this task and propose a sophisticated basin-based evaluation (BBE) method. Also, BBE variants are developed, capturing the anytime behavior of algorithms. The set of BBE measures is tested by means of an algorithm configuration study. We show that these new measures also transfer properties of the well-established hypervolume (HV) indicator to the domain of MMMOO, thus also accounting for objective space convergence. Moreover, we advance MMMOO research by providing insights into the multimodal performance of the considered algorithms. Specifically, algorithms exploiting local structures are shown to outperform classical evolutionary multi-objective optimizers regarding the BBE variants and respective trade-off with HV.}},
  author       = {{Heins, Jonathan and Rook, Jeroen and Schäpermeier, Lennart and Kerschke, Pascal and Bossek, Jakob and Trautmann, Heike}},
  booktitle    = {{Parallel Problem Solving from Nature (PPSN XVII)}},
  editor       = {{Rudolph, Günter and Kononova, Anna V. and Aguirre, Hernán and Kerschke, Pascal and Ochoa, Gabriela and Tusar, Tea}},
  isbn         = {{978-3-031-14714-2}},
  keywords     = {{Anytime behavior, Benchmarking, Continuous optimization, Multi-objective optimization, Multimodality, Performance metric}},
  pages        = {{192–206}},
  publisher    = {{Springer International Publishing}},
  title        = {{{BBE: Basin-Based Evaluation of Multimodal Multi-objective Optimization Problems}}},
  doi          = {{10.1007/978-3-031-14714-2_14}},
  year         = {{2022}},
}

@inproceedings{33997,
  abstract     = {{Digital platforms have already led to disruptions in multiple B2C markets and are becoming increasingly dominant in B2B markets. As a result, more and more companies are trying to participate in the platform economy. However, the successful development and operation of a digital platform is associated with significant challenges, which leads to 85% of all platforms failing. A core challenge is the dynamic nature of the platform economy, with varying strategic objectives at different stages in the platform lifecycle. Platform operators must continuously monitor platform progress and adjust their strategy.
Utilizing action research in the real-world platform project AI Marketplace, we developed a lifecycle-oriented performance management approach for digital platforms in B2B markets. It enables platform operators to reflect on their position in the platform lifecycle, derive relevant strategic objectives, and monitor them with suitable key performance indicators. Hence, allowing them to secure the long-term success of their platform business.}},
  author       = {{Özcan, Leon and Kirchberg, Lisa Irene and Koldewey, Christian and Dumitrescu, Roman}},
  booktitle    = {{The Role of Innovation: Past, Present, Future}},
  editor       = {{Bitran, Iain and Bitetti, Leandro and  Conn, Steffen and Fishburn, Jessica and Huizingh, Eelko  and Torkkeli, Marko and Yang, Jialei}},
  keywords     = {{Digital Platform, Two-Sided Market, Multi-Sided Market, Platform Lifecycle, Platform Monitoring, Performance Management}},
  location     = {{Athens}},
  title        = {{{Performance Management Approach for Digital Platforms in B2B Markets}}},
  year         = {{2022}},
}

@inbook{58332,
  author       = {{Schulte Eickholt, Swen}},
  booktitle    = {{Transkulturelle Wechselwirkungen durch Künste und Soziales: Iranische Diaspora in Europa und darüber hinaus}},
  editor       = {{Nowrousian, Shirin}},
  isbn         = {{978-3-8260-7652-7}},
  keywords     = {{Navid Kermani, Theater, Performance, Autofiktion, Dein Name}},
  pages        = {{171--182}},
  publisher    = {{Königshausen und Neumann}},
  title        = {{{Die Ta'ziyeh als poetisches Prinzip von Navid Kermanis Roman Dein Name}}},
  year         = {{2022}},
}

@inproceedings{24550,
  abstract     = {{Efficiencies and energy yields of microinverters available on the market during 2014‒2021 have been 
measured, compared, and ranked. Conversion efficiencies as a function of load have been measured indoors with high 
accuracy and ranked according to Euro- and CEC weightings. Energy yields have been measured outdoors via 
identical and calibrated crystalline silicon PV modules of 215 Wp (until 2020) and 360 Wp (starting 2021). Inverters 
with two inputs have been fed by two of those modules. DC input, AC power output and energy yield of each microinverter have been recorded by individual calibrated electricity meters. CEC and EU efficiency rankings have been 
computed and compared. To assess the influence of PV module size, two extremes have been investigated: A rather 
small module with 215 Wp - as it has been used 10 years ago, and a brand-new module (2021) offering 360 Wp. Both 
types of modules contain 60 solar cells in series connection. Appling the low-power modules, the challenge for the 
different micro-inverters has been during weak-light conditions, using the high-power modules, some inverters 
temporarily reach their power limits and yield is reduced. A method using a reference configuration of inverter & 
module and a linear equation y = ax + b resulting in the actual yield, any module & inverter configuration can be 
characterized by just the coefficients a and b.}},
  author       = {{Krauter, Stefan and Bendfeld, Jörg}},
  booktitle    = {{Proceedings of the 38th European Photovoltaic Solar Energy Conference and Exhibition (EU PVSEC 2021)}},
  isbn         = {{3-936338-78-7}},
  keywords     = {{AC-modules, Microinverter, Power Conditioning, Efficiency, Yield, PV module size, saturation, performance}},
  pages        = {{659 -- 663}},
  title        = {{{Module-Inverters (Microinverters): Influence of Module Size on Conversion Efficiencies and Energy Yields}}},
  doi          = {{10.4229/EUPVSEC20212021-4CO.3.4}},
  year         = {{2021}},
}

@inproceedings{18387,
  abstract     = {{ During comparative measurements of different PV microinverters, two yield issues came up that could 
not be explored via conventional efficiency measurements, but do have a significant impact on electrical energy 
yield: First category of issues are either sluggish or nervously acting maximum–power–point–tracking devices, which 
lead to reduced energy yields. The other category of issues is thermal: As a first explanation for observed reduced 
energy yields, it has been assumed that the conversion efficiency degrades at higher operating temperatures. This 
matter has been investigated in this article: A change in conversion efficiency could not be observed for elevated 
operation temperatures up to 50°C, despite high-precision and repeated measurements. But it was found that some 
inverters temporarily interrupted (or entirely stopped) operation after long periods of running at high temperatures. 
Also, a reduction in potential maximum power output has been detected for those inverters. Summarizing: With a 
high degree of certainty it can be stated that those reported yield losses have been caused by the temporary shutdowns 
and power limitations of the inverters.}},
  author       = {{Krauter, Stefan and Bendfeld, Jörg}},
  booktitle    = {{Proceedings of the EU PVSEC 2020 }},
  issn         = {{3-936338-73-6}},
  keywords     = {{AC-modules, Microinverter, Power Conditioning, Thermal Performance, Ventilation, Stability, Efficiency, Yield}},
  location     = {{online}},
  pages        = {{1179 -- 1180}},
  title        = {{{Elevated Temperatures Affecting Efficiency, Overall Performance and Energy Yield of PV Microinverters}}},
  doi          = {{10.4229/EUPVSEC20202020-4AV.3.6}},
  year         = {{2020}},
}

@article{48848,
  abstract     = {{We build upon a recently proposed multi-objective view onto performance measurement of single-objective stochastic solvers. The trade-off between the fraction of failed runs and the mean runtime of successful runs \textendash both to be minimized \textendash is directly analyzed based on a study on algorithm selection of inexact state-of-the-art solvers for the famous Traveling Salesperson Problem (TSP). Moreover, we adopt the hypervolume indicator (HV) commonly used in multi-objective optimization for simultaneously assessing both conflicting objectives and investigate relations to commonly used performance indicators, both theoretically and empirically. Next to Penalized Average Runtime (PAR) and Penalized Quantile Runtime (PQR), the HV measure is used as a core concept within the construction of per-instance algorithm selection models offering interesting insights into complementary behavior of inexact TSP solvers. \textbullet The multi-objective perspective is naturally generalizable to multiple objectives. \textbullet Proof of relationship between HV and the PAR in the considered bi-objective space. \textbullet New insights into complementary behavior of stochastic optimization algorithms.}},
  author       = {{Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}},
  issn         = {{1568-4946}},
  journal      = {{Applied Soft Computing}},
  keywords     = {{Algorithm selection, Combinatorial optimization, Multi-objective optimization, Performance measurement, Traveling Salesperson Problem}},
  number       = {{C}},
  title        = {{{A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms}}},
  doi          = {{10.1016/j.asoc.2019.105901}},
  volume       = {{88}},
  year         = {{2020}},
}

@article{46334,
  abstract     = {{We build upon a recently proposed multi-objective view onto performance measurement of single-objective stochastic solvers. The trade-off between the fraction of failed runs and the mean runtime of successful runs – both to be minimized – is directly analyzed based on a study on algorithm selection of inexact state-of-the-art solvers for the famous Traveling Salesperson Problem (TSP). Moreover, we adopt the hypervolume indicator (HV) commonly used in multi-objective optimization for simultaneously assessing both conflicting objectives and investigate relations to commonly used performance indicators, both theoretically and empirically. Next to Penalized Average Runtime (PAR) and Penalized Quantile Runtime (PQR), the HV measure is used as a core concept within the construction of per-instance algorithm selection models offering interesting insights into complementary behavior of inexact TSP solvers.}},
  author       = {{Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}},
  issn         = {{1568-4946}},
  journal      = {{Applied Soft Computing}},
  keywords     = {{Algorithm selection, Multi-objective optimization, Performance measurement, Combinatorial optimization, Traveling Salesperson Problem}},
  pages        = {{105901}},
  title        = {{{A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms}}},
  doi          = {{https://doi.org/10.1016/j.asoc.2019.105901}},
  volume       = {{88}},
  year         = {{2020}},
}

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

@article{4562,
  abstract     = {{Employing main and sector-specific investment-grade CDS indices from the North American and European CDS market and performing mean-variance out-of-sample analyses for conservative and aggressive investors over the period from 2006 to 2014, this paper analyzes portfolio benefits of adding corporate CDS indices to a traditional financial portfolio consisting of stock and sovereign bond indices. As a baseline result, we initially find an increase in portfolio (downside) risk-diversification when adding CDS indices, which is observed irrespective of both CDS markets, investor-types and different sub-periods, including the global financial crisis and European sovereign debt crisis. In addition, the analysis reveals higher portfolio excess returns and performance in CDS index portfolios, however, these effects clearly differ between markets, investor-types and sub-periods. Overall, portfolio benefits of adding CDS indices mainly result from the fact that institutional investors replace sovereign bond indices rather than stock indices by CDS indices due to better risk-return characteristics. Our baseline findings remain robust under a variety of robustness checks. Results from sensitivity analyses provide further important implications for institutional investors with a strategic focus on a long-term conservative portfolio management.}},
  author       = {{Hippert, Benjamin and Uhde, André and Wengerek, Sascha Tobias}},
  journal      = {{Review of Derivatives Research }},
  keywords     = {{Corporate credit default swap indices, Mean-variance asset allocation, Out-of-sample portfolio optimization, Portfolio risk-diversification, Portfolio performance evaluation}},
  number       = {{2}},
  pages        = {{203--259}},
  title        = {{{Portfolio Benefits of Adding Corporate Credit Default Swap Indices: Evidence from North America and Europe}}},
  doi          = {{https://doi.org/10.1007/s11147-018-9148-8}},
  volume       = {{22}},
  year         = {{2019}},
}

@inproceedings{48875,
  abstract     = {{A multiobjective perspective onto common performance measures such as the PAR10 score or the expected runtime of single-objective stochastic solvers is presented by directly investigating the tradeoff between the fraction of failed runs and the average runtime. Multi-objective indicators operating in the bi-objective space allow for an overall performance comparison on a set of instances paving the way for instance-based automated algorithm selection techniques.}},
  author       = {{Bossek, Jakob and Trautmann, Heike}},
  booktitle    = {{Learning and Intelligent Optimization}},
  editor       = {{Battiti, Roberto and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}},
  isbn         = {{978-3-030-05348-2}},
  keywords     = {{Algorithm selection, Performance measurement}},
  pages        = {{215–219}},
  publisher    = {{Springer International Publishing}},
  title        = {{{Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time}}},
  doi          = {{10.1007/978-3-030-05348-2_19}},
  year         = {{2019}},
}

@article{20688,
  abstract     = {{We offer the first empirical analysis connecting the timing of general partner (GP) compensation to private equity fund performance. Using detailed information on limited partnership agreements between private equity limited and general partners, we find that “GP-friendly” contracts—agreements that pay general partners on a deal-by-deal basis instead of withholding carried interest until a benchmark return has been earned—are associated with higher returns, both gross and net of fees. This is robust to measures of performance persistence, time period effects, and other contract terms and is related to exit-timing incentives. Timing practices balance GP incentives against limited partner downside protection.}},
  author       = {{Hüther, Niklas and Robinson, David T. and Sievers, Sönke and Hartmann-Wendels, Thomas}},
  issn         = {{0025-1909}},
  journal      = {{Management Science (VHB-JOURQUAL 4 Ranking A+)}},
  keywords     = {{venture capital, compensation, private equity, VC partnership, pay-performance relation}},
  number       = {{4}},
  pages        = {{1756--1782}},
  title        = {{{Paying for Performance in Private Equity: Evidence from Venture Capital Partnerships}}},
  doi          = {{10.1287/mnsc.2018.3274}},
  volume       = {{66}},
  year         = {{2019}},
}

@inproceedings{48867,
  abstract     = {{Assessing the performance of stochastic optimization algorithms in the field of multi-objective optimization is of utmost importance. Besides the visual comparison of the obtained approximation sets, more sophisticated methods have been proposed in the last decade, e. g., a variety of quantitative performance indicators or statistical tests. In this paper, we present tools implemented in the R package ecr, which assist in performing comprehensive and sound comparison and evaluation of multi-objective evolutionary algorithms following recommendations from the literature.}},
  author       = {{Bossek, Jakob}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference Companion}},
  isbn         = {{978-1-4503-5764-7}},
  keywords     = {{evolutionary optimization, performance assessment, software-tools}},
  pages        = {{1350–1356}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package ecr}}},
  doi          = {{10.1145/3205651.3208312}},
  year         = {{2018}},
}

@inproceedings{48885,
  abstract     = {{Performance comparisons of optimization algorithms are heavily influenced by the underlying indicator(s). In this paper we investigate commonly used performance indicators for single-objective stochastic solvers, such as the Penalized Average Runtime (e.g., PAR10) or the Expected Running Time (ERT), based on exemplary benchmark performances of state-of-the-art inexact TSP solvers. Thereby, we introduce a methodology for analyzing the effects of (usually heuristically set) indicator parametrizations - such as the penalty factor and the method used for aggregating across multiple runs - w.r.t. the robustness of the considered optimization algorithms.}},
  author       = {{Kerschke, Pascal and Bossek, Jakob and Trautmann, Heike}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference Companion}},
  isbn         = {{978-1-4503-5764-7}},
  keywords     = {{algorithm selection, optimization, performance measures, transportation, travelling salesperson problem}},
  pages        = {{1737–1744}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers}}},
  doi          = {{10.1145/3205651.3208233}},
  year         = {{2018}},
}

@article{48884,
  abstract     = {{The Travelling Salesperson Problem (TSP) is one of the best-studied NP-hard problems. Over the years, many different solution approaches and solvers have been developed. For the first time, we directly compare five state-of-the-art inexact solvers\textemdash namely, LKH, EAX, restart variants of those, and MAOS\textemdash on a large set of well-known benchmark instances and demonstrate complementary performance, in that different instances may be solved most effectively by different algorithms. We leverage this complementarity to build an algorithm selector, which selects the best TSP solver on a per-instance basis and thus achieves significantly improved performance compared to the single best solver, representing an advance in the state of the art in solving the Euclidean TSP. Our in-depth analysis of the selectors provides insight into what drives this performance improvement.}},
  author       = {{Kerschke, Pascal and Kotthoff, Lars and Bossek, Jakob and Hoos, Holger H. and Trautmann, Heike}},
  issn         = {{1063-6560}},
  journal      = {{Evolutionary Computation}},
  keywords     = {{automated algorithm selection, machine learning., performance modeling, Travelling Salesperson Problem}},
  number       = {{4}},
  pages        = {{597–620}},
  title        = {{{Leveraging TSP Solver Complementarity through Machine Learning}}},
  doi          = {{10.1162/evco_a_00215}},
  volume       = {{26}},
  year         = {{2018}},
}

@article{5185,
  abstract     = {{We offer the first empirical analysis connecting the timing of general partner (GP) compensation to private equity fund performance. Using detailed information on limited partnership agreements between private equity limited and general partners, we find that "GP-friendly" contracts - agreements that pay general partners on a deal-by-deal basis instead of withholding carried interest until a benchmark return has been earned - are associated with higher returns, both gross and net of fees. This is robust to measures of performance persistence, time period effects, and other contract terms, and is related to exit-timing incentives. Timing practices balance GP incentives against limited partner downside protection. }},
  author       = {{Hüther, Niklas and Robinson, David and Sievers, Sönke and Hartmann-Wendels, Thomas}},
  journal      = {{SSRN Electronic Journal}},
  keywords     = {{venture capital, compensation, private equity, VC partnership, pay-performance relation}},
  title        = {{{Paying for Performance in Private Equity: Evidence from VC Partnerships}}},
  doi          = {{10.2139/ssrn.3087320}},
  year         = {{2017}},
}

@inproceedings{10780,
  author       = {{Guettatfi, Zakarya and Hübner, Philipp and Platzner, Marco and Rinner, Bernhard}},
  booktitle    = {{12th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC)}},
  keywords     = {{embedded systems, image sensors, power aware computing, wireless sensor networks, Zynq-based VSN node prototype, computational self-awareness, design approach, platform levels, power consumption, visual sensor networks, visual sensor nodes, Cameras, Hardware, Middleware, Multicore processing, Operating systems, Runtime, Reconfigurable platforms, distributed embedded systems, performance-resource trade-off, self-awareness, visual sensor nodes}},
  pages        = {{1--8}},
  title        = {{{Computational self-awareness as design approach for visual sensor nodes}}},
  doi          = {{10.1109/ReCoSoC.2017.8016147}},
  year         = {{2017}},
}

@inproceedings{5678,
  abstract     = {{Many academic disciplines - including information systems, computer science, and operations management - face scheduling problems as important decision making tasks. Since many scheduling problems are NP-hard in the strong sense, there is a need for developing solution heuristics. For scheduling problems with setup times on unrelated parallel machines, there is limited research on solution methods and to the best of our knowledge, parallel computer architectures have not yet been taken advantage of. We address this gap by proposing and implementing a new solution heuristic and by testing different parallelization strategies. In our computational experiments, we show that our heuristic calculates near-optimal solutions even for large instances and that computing time can be reduced substantially by our parallelization approach.}},
  author       = {{Rauchecker, Gerhard and Schryen, Guido}},
  booktitle    = {{Australasian Conference on Information Systems}},
  keywords     = {{scheduling, decision support, heuristic, high performance computing, parallel algorithms}},
  pages        = {{1--13}},
  title        = {{{High-Performance Computing for Scheduling Decision Support: A Parallel Depth-First Search Heuristic}}},
  year         = {{2015}},
}

