Search Results - "Kress, Dominik"

Mechanism design for machine scheduling problems: classification and literature overview by Kress, Dominik, Meiswinkel, Sebastian, Pesch, Erwin

“…This paper provides a literature overview on (direct revelation) algorithmic mechanism design in the context of machine scheduling problems. Here, one takes a…”
Get full text

Sequential competitive location on networks by Kress, Dominik, Pesch, Erwin

“…► We survey continuous sequential competitive location problems on networks. ► We include the closely related class of voting location problems. ► We classify…”
Get full text

An exact solution approach for scheduling cooperative gantry cranes by Kress, Dominik, Dornseifer, Jan, Jaehn, Florian

“…•We consider rail mounted gantry cranes that serve seaside and landside jobs.•We allow seaside jobs to be preempted (cooperation of cranes).•A dynamic…”
Get full text

Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas by Kress, Dominik, Meiswinkel, Sebastian, Pesch, Erwin

“…•We consider a straddle carrier routing problem at seaports.•Gantry cranes are equipped with short term storage areas (buffer areas).•We assume that the…”
Get full text

The Piggyback Transportation Problem: Transporting drones launched from a flying warehouse by Wang, Kai, Pesch, Erwin, Kress, Dominik, Fridman, Ilia, Boysen, Nils

“…•We formulate a novel transportation problem including two types of vehicles.•Small delivery vehicles are brought close to the customers by a large vehicle.•We…”
Get full text

Filter-and-fan approaches for scheduling flexible job shops under workforce constraints by Müller, David, Kress, Dominik

“…This paper addresses a flexible job shop scheduling problem that takes account of workforce constraints and aims to minimise the makespan. The former…”
Get full text

Semiconductor final-test scheduling under setup operator constraints by Kress, Dominik, Müller, David

“…We consider a semiconductor final-test scheduling problem that aims at minimizing the total weighted tardiness. In contrast to previous studies on this…”
Get full text

Reinvestigating the uniqueness of price equilibria in a product positioning model under price competition in a multisegmented market by Kress, Dominik

“…We reinvestigate a theoretical result by Rhim and Cooper (2005), who provide a uniqueness condition for price equilibria in a two-stage competitive product…”
Get full text

Competitive Location and Pricing on Networks with Random Utilities by Kress, Dominik, Pesch, Erwin

“…In this paper we analyze the effect of including price competition into a classical (market entrant’s) competitive location problem. The multinomial logit…”
Get full text

An algorithm selection approach for the flexible job shop scheduling problem: Choosing constraint programming solvers through machine learning by Müller, David, Müller, Marcus G., Kress, Dominik, Pesch, Erwin

“…•We consider the scheduling of flexible job shops to minimize the makespan.•A computational study benchmarks various constraint programming solvers.•The…”
Get full text

A worker constrained flexible job shop scheduling problem with sequence-dependent setup times by Kress, Dominik, Müller, David, Nossack, Jenny

“…We consider a flexible job shop scheduling problem with sequence-dependent setup times that incorporates heterogeneous machine operator qualifications by…”
Get full text

Which items should be stored together? A basic partition problem to assign storage space in group-based storage systems by Kress, Dominik, Boysen, Nils, Pesch, Erwin

“…We consider a basic partition problem that subdivides Stock Keeping Units (SKUs) into disjoint subsets, such that the minimum number of groups has to be…”
Get full text

The Partitioning Min–Max Weighted Matching Problem by Kress, Dominik, Meiswinkel, Sebastian, Pesch, Erwin

“…•We introduce the Partitioning Min–Max Weighted Matching Problem (PMMWM).•PMMWM combines a maximum matching and a partitioning problem.•Applications arise in…”
Get full text

(r|p)-centroid problems on networks with vertex and edge demand by Kress, Dominik, Pesch, Erwin

“…This paper analyzes (r|p)-centroid problems on networks with vertex and edge demand under a binary choice rule. Bilevel programming models are presented for…”
Get full text

Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines by Kress, Dominik, Barketau, Maksim, Pesch, Erwin

“…We address the single-machine batch scheduling problem with the objective of minimizing the total setup cost. This problem arises when there are n jobs that…”
Get full text

A parallel machine schedule updating game with compensations and clients averse to uncertain loss by Kovalyov, Mikhail Y., Kress, Dominik, Meiswinkel, Sebastian, Pesch, Erwin

“…•We consider the problem of scheduling selfish jobs on parallel machines.•Job weights and due dates are private information of the jobs.•The jobs (resp. their…”
Get full text

LAVES: An Extensible Visualization Tool to Facilitate the Process of Learning and Teaching Algorithms by Kress, Dominik, Dornseifer, Jan

“…The Logistics Algorithms Visualization and Education Software (LAVES) is an open source project at the University of Siegen, aiming at supporting business and…”
Get full text

An Integrated Matching and Partitioning Problem with Applications in Intermodal Transport by Pesch, Erwin, Kress, Dominik, Meiswinkel, Sebastian

“…We introduce a combination of the problem of partitioning a set of vertices of a bipartite graph into disjoint subsets of restricted size and the Min-Max…”
Get full text

Decentralized sequencing of jobs on a single machine by Pesch, Erwin, Kovalyov, Mikhail Y., Kress, Dominik, Meiswinkel, Sebastian

“…There is a finite number of non-cooperating clients competing for execution of their jobs by a single service provider in order to minimize job completion time…”
Get full text