2 citations · 2 across the 3 of their papers we have counts for
4 papers · 1 filter
Approximating Weighted Completion Time for Order Scheduling with Setup Times
Alexander Mäcker, Friedhelm Meyer auf der Heide, Simon Pukrop
Consider a scheduling problem in which jobs need to be processed on a single machine. Each job has a weight and is composed of several operations belonging to different families. T…
Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times
Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide +1
Consider a problem in which jobs that are classified into types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the ma…
Monitoring of Domain-Related Problems in Distributed Data Streams
Pascal Bemmann, Felix Biermeier, Jan Bürmann +10
Consider a network in which distributed nodes are connected to a single server. Each node continuously observes a data stream consisting of one value per discrete time step. Th…
Non-Preemptive Scheduling on Machines with Setup Times
Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide +1
Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s tim…