15 citations · 22 across the 7 of their papers we have counts for
4 papers · 1 filter
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…
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…
Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms
Jörg Lässig, Dirk Sudholt
We present two adaptive schemes for dynamically choosing the number of parallel instances in parallel evolutionary algorithms. This includes the choice of the offspring population…