15 citations · 22 across the 7 of their papers we have counts for
9 papers
Connecting the Hamiltonian structure to the QAOA performance and energy landscape
Daniel Müssig, Markus Wappler, Steve Lenk +1
Quantum computing holds promise for outperforming classical computing in specialized applications such as optimization. With current Noisy Intermediate Scale Quantum (NISQ) devices…
A Novel Approach to the Common Due-Date Problem on Single and Parallel Machines
Abhishek Awasthi, Jörg Lässig, Oliver Kramer
This paper presents a novel idea for the general case of the Common Due-Date (CDD) scheduling problem. The problem is about scheduling a certain number of jobs on a single or paral…
Dynamic Integration of ALM Tools for Agile Software Development
Max Wielsch, Raik Bieniek, Bernd Grams +1
The paper describes the need for and goals of tool-integration within software development processes. In particular we focus on agile software development but are not limited to. T…
Aircraft Landing Problem: Efficient Algorithm for a Given Landing Sequence
Abhishek Awasthi, Oliver Kramer, Jörg Lässig
In this paper, we investigate a special case of the static aircraft landing problem (ALP) with the objective to optimize landing sequences and landing times for a set of air planes…
Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence
Abhishek Awasthi, Jörg Lässig, Oliver Kramer
This paper considers the problem of scheduling jobs on single and parallel machines where all the jobs possess different processing times but a common due date. There is a penalty…
General Upper Bounds on the Running Time of Parallel Evolutionary Algorithms
Jörg Lässig, Dirk Sudholt
We present a new method for analyzing the running time of parallel evolutionary algorithms with spatially structured populations. Based on the fitness-level method, it yields upper…