6 citations · 10 across the 6 of their papers we have counts for
8 papers
Solving Parallel Machine Scheduling With Precedences and Cumulative Resource Constraints With Calendars
Christoph Einspieler, Matthias Horn, Marie-Louise Lackner +3
The task of finding efficient production schedules for parallel machines is a challenge that arises in most industrial manufacturing domains. There is a large potential to minimize…
Theoretical Lower Bounds for the Oven Scheduling Problem
Francesca Da Ros, Marie-Louise Lackner, Nysret Musliu
The Oven Scheduling Problem (OSP) is an NP-hard real-world parallel batch scheduling problem arising in the semiconductor industry. The objective of the problem is to schedule a se…
Exact methods and lower bounds for the Oven Scheduling Problem
Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu +2
The Oven Scheduling Problem (OSP) is a new parallel batch scheduling problem that arises in the area of electronic component manufacturing. Jobs need to be scheduled to one of seve…
Exact and Metaheuristic Approaches for the Production Leveling Problem
Johannes Vass, Marie-Louise Lackner, Nysret Musliu
In this paper we introduce a new problem in the field of production planning which we call the Production Leveling Problem. The task is to assign orders to production periods such…
A Mathematical Analysis of an Election System Proposed by Gottlob Frege
Paul Harrenstein, Marie-Louise Lackner, Martin Lackner
In 1998 a long-lost proposal for an election law by Gottlob Frege (1848--1925) was rediscovered in the Thüringer Universitäts- und Landesbibliothek in Jena, Germany. The method tha…
Longest increasing subsequences and log concavity
Miklós Bóna, Marie-Louise Lackner, Bruce Sagan
Let be a permutation of and denote by the length of a longest increasing subsequence of . Let be the number of permutations of…
The Complexity of Pattern Matching for -Avoiding and Skew-Merged Permutations
Michael H. Albert, Marie-Louise Lackner, Martin Lackner +1
The Permutation Pattern Matching problem, asking whether a pattern permutation is contained in a permutation , is known to be NP-complete. In this paper we present two polyn…
Runs in labelled trees and mappings
Marie-Louise Lackner, Alois Panholzer
We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set into itself. A co…