Finke Gerd

Gerd Finke

Information about the author Gerd Finke will soon be added to the site.
Found 11 papers in total
Two classical transportation problems revisited: Pure constant fixed charges and the paradox
Two classical transportation problems revisited: Pure constant fixed charges and the paradox
2011
We analyze degeneracy characterizations for two classical problems: the transportation...
Single machine scheduling with small operator‐non‐availability periods
Single machine scheduling with small operator‐non‐availability periods
2012
For an industrial application in the chemical industry, we were confronted with the...
Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
2006
Conditions imposed on the matrices of the Quadratic Assignment Problem (QAP) are...
Approximation algorithms for the design of SDH/SONET networks
Approximation algorithms for the design of SDH/SONET networks
2003
In this paper, a graph partitioning problem that arises in the design of SONET/SDH...
General flowshop models: Job dependent capacities, job overlapping and deterioration
General flowshop models: Job dependent capacities, job overlapping and deterioration
2002
Several extensions of the two-machine flowshop model that arise in industrial...
Optimal moves of the material handling system in a robotic cell
Optimal moves of the material handling system in a robotic cell
2001
We consider the so-called robotic cells, i.e. flow-shops with a central robot that...
Scheduling on a batch machine with job compatibilities
Scheduling on a batch machine with job compatibilities
2000
We consider the problem of minimizing the makespan on a single batch processing...
k-server problems with bulk requests: An application to tool switching in manufacturing
k-server problems with bulk requests: An application to tool switching in manufacturing
2000
The classical k -server problem has been widely used to model two-level memory systems...
On a conjecture about robotic cells: New simplified proof for the three-machine case
On a conjecture about robotic cells: New simplified proof for the three-machine case
1999
We consider a robotic cell, consisting of a flow-shop in which the machines are served...
Scheduling with resource management in manufacturing systems
Scheduling with resource management in manufacturing systems
1994
Modern manufacturing technology has made it possible to concentrate the total...
Scheduling tasks and vehicles in a flexible manufacturing system
Scheduling tasks and vehicles in a flexible manufacturing system
1991
Due to their increasing applicability in modern industry, flexible manufacturing...
Papers per page: