16 citations · 29 across the 19 of their papers we have counts for
16 papers · 1 filter
The Project Scheduling Interdiction Problem with Delay Groups
Fei Wu, Erik Demeulemeester, Jannik Matuschke
Large-scale projects are frequently delayed by correlated disruptions: when a shared input such as a common supplier, a specialized team, or a supporting platform degrades, all dep…
Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction
Jannik Matuschke
We study the following fundamental network optimization problem known as Maximum Robust Flow (MRF): A planner determines a flow on --paths in a given capacitated network. The…
Decomposing Probability Marginals Beyond Affine Requirements
Jannik Matuschke
Consider the triplet , where is a finite ground set, is a collection of subsets of and i…
Decomposition of Probability Marginals for Security Games in Max-Flow/Min-Cut Systems
Jannik Matuschke
Given a set system with and , our goal is to find a probability distribution for a random set such tha…
A Constant-Factor Approximation for Generalized Malleable Scheduling under -Concave Processing Speeds
Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
In generalized malleable scheduling, jobs can be allocated and processed simultaneously on multiple machines so as to reduce the overall makespan of the schedule. The required proc…
Assigning and Scheduling Generalized Malleable Jobs under Subadditive or Submodular Processing Speeds
Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
Malleable scheduling is a model that captures the possibility of parallelization to expedite the completion of time-critical tasks. A malleable job can be allocated and processed s…