Nowicki Eugeniusz

Eugeniusz Nowicki

Information about the author Eugeniusz Nowicki will soon be added to the site.
Found 12 papers in total
An advanced Tabu search algorithm for the job shop problem
An advanced Tabu search algorithm for the job shop problem
2005
The job shop scheduling problem with the makespan criterion is a certain NP-hard case...
Some aspects of scatter search in the flow-shop problem
Some aspects of scatter search in the flow-shop problem
2006
The flow-shop scheduling problem with the makespan criterion is a certain strongly...
The permutation flow shop with buffers: A tabu search approach
The permutation flow shop with buffers: A tabu search approach
1999
The paper deals with the criteria of makespan minimisation for the permutation flow...
The flow shop with parallel machines: A tabu search approach
The flow shop with parallel machines: A tabu search approach
1998
A fast and easily implementable approximation algorithm for the problem of finding a...
A fast tabu search algorithm for the permutation flow-shop problem
A fast tabu search algorithm for the permutation flow-shop problem
1996
A fast and easily implementable approximation algorithm for the problem of finding a...
A note on worst-case analysis of approximation algorithms for a scheduling problem
A note on worst-case analysis of approximation algorithms for a scheduling problem
1994
Worst-case analyses of two approximation algorithms for the m -machine permutation...
An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
1994
The paper deals with a single-machine scheduling problem with release times, delivery...
A fast tabu search algorithm for the job shop problem
A fast tabu search algorithm for the job shop problem
1996
A fast and easily implementable approximation algorithm for the problem of finding a...
An approximation algorithm for the m-machine permutation flow shop scheduling problemwith controllable processing times
An approximation algorithm for the m-machine permutation flow shop scheduling problemwith controllable processing times
1993
This paper deals with the m- machine permutation flow shop scheduling problem in which...
An approximation algorithm for a single-machine scheduling problem with release times and delivery times
An approximation algorithm for a single-machine scheduling problem with release times and delivery times
1994
The authors consider the scheduling problem in which jobs with release times and...
Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
1991
A worst-case analysis of an algorithm proposed by Dannenbring for the m -machine...
Worst-case analysis of an approximation algorithm for flow-shop scheduling
Worst-case analysis of an approximation algorithm for flow-shop scheduling
1989
A worst-case analysis of an algorithm proposed by Campbell et al. for the m- machine...
Papers per page: