Woeginger Gerhard J.

Gerhard J. Woeginger

Information about the author Gerhard J. Woeginger will soon be added to the site.
Found 64 papers in total
Sequencing jobs that require common resources on a single machine: A solvable case of the traveling salesman problem
Sequencing jobs that require common resources on a single machine: A solvable case of the traveling salesman problem
1998
In this paper a one-machine scheduling model is analyzed where n different jobs are...
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
1998
This paper investigates a restricted version of the Quadratic Assignment Problem...
The computational complexity of the k-minimum spanning tree problem in graded matrices
The computational complexity of the k-minimum spanning tree problem in graded matrices
1998
Given an undirected graph G = ( V, E ) where each edge e = ( i, j ) has...
Well-solvable special cases of the traveling salesman problem: A survey
Well-solvable special cases of the traveling salesman problem: A survey
1998
The traveling salesman problem belongs to the most basic, most important, and most...
The stock size problem
The stock size problem
1998
Consider a number of jobs that have to be completed within some fixed period of time....
Geometric three-dimensional assignment problems
Geometric three-dimensional assignment problems
1996
We investigate two geometric special cases of the three-dimensional assignment...
A polynomial-time approximation scheme for maximizing the minimum machine completion time
A polynomial-time approximation scheme for maximizing the minimum machine completion time
1997
We consider the problem of assigning a set of n jobs to a system of m identical...
Minimizing the total completion time in a unit-time open shop with release times
Minimizing the total completion time in a unit-time open shop with release times
1997
We consider the problem of minimizing the total completion time in a unit-time open...
A minimax assignment problem in treelike communication networks
A minimax assignment problem in treelike communication networks
1995
A given system of communication centres C 1 , C 2...
An optimal algorithm for preemptive on-line scheduling
An optimal algorithm for preemptive on-line scheduling
1995
The authors investigate the problem of on-line scheduling jobs on m identical parallel...
Monge matrices make maximization manageable
Monge matrices make maximization manageable
1994
The authors continue the research on the effects of Monge structures in the area of...
UET-scheduling with chain-type precedence constraints
UET-scheduling with chain-type precedence constraints
1995
The authors consider a special case of the precedence constrained scheduling problem...
New lower and upper bounds for on-line scheduling
New lower and upper bounds for on-line scheduling
1994
The authors investigate the problem of on-line scheduling a set of independent jobs on...
Scheduling with Safety Distances
Scheduling with Safety Distances
1995
The authors investigate the problem of Scheduling with Safety Distances (SSD) that...
Fast algorithms for the maximum convolution problem
Fast algorithms for the maximum convolution problem
1994
The authors describe two algorithms for solving the maximum convolution problem, i.e....
A variation of Graham’s LPT-algorithm
A variation of Graham’s LPT-algorithm
1991
The authors consider the problem of scheduling a set of n jobs nonpreemptively on m...
Papers per page: