Smutnicki Czesaw

Czesaw Smutnicki

Information about the author Czesaw Smutnicki will soon be added to the site.
Found 5 papers in total
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
2006
The flow-shop scheduling problem with the makespan criterion is a certain strongly...
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 and delivery times
1994
The authors consider the scheduling problem in which jobs with release times and...
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: