Werner F.

F. Werner

Information about the author F. Werner will soon be added to the site.
Found 9 papers in total
A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
1999
In this paper, we propose different heuristic algorithms for flow shop scheduling...
On the application of insertion techniques for job shop problems with setup times
On the application of insertion techniques for job shop problems with setup times
1999
Constructive heuristics for shop scheduling problems are often based on priority (or...
Stability of an optimal schedule in a job shop
Stability of an optimal schedule in a job shop
1997
This paper is devoted to the calculation of the stability radius of an optimal...
Heuristics for permutation flow stop scheduling with batch setup times
Heuristics for permutation flow stop scheduling with batch setup times
1996
In this paper the authors consider permutation flow shop scheduling problems with...
A polynomial algorithm for the [n/m/0,tij=1, tree/Cmax] open shop problem
A polynomial algorithm for the [n/m/0,tij=1, tree/Cmax] open shop problem
1994
In this paper the authors consider the open shop problem with unit processing times...
A polynomial algorithm for an open shop problem with unit processing times and tree constraints
A polynomial algorithm for an open shop problem with unit processing times and tree constraints
1995
In this paper the authors consider the optn shop problem with unit processing times...
On the combinatorial structure of the permutation flow shop problem
On the combinatorial structure of the permutation flow shop problem
1991
The paper investigates the combinatorial structure of the n/m/P/C max permutation flow...
Some relations between neighbourhood graphs for a permutation problem
Some relations between neighbourhood graphs for a permutation problem
1991
Many discrete optimization problems belong to the class NP-hard. Therefore heuristics...
Solution of special scheduling problems by some neighbourhood structures of iteration methods
Solution of special scheduling problems by some neighbourhood structures of iteration methods
1988
Many discrete optimization problems belong to the class of NP-hard problems. Therefore...
Papers per page: