Eugeniusz Nowicki

According to our database, Eugeniusz Nowicki authored at least 10 papers between 1990 and 2006.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2006

Some aspects of scatter search in the flow-shop problem.

Eugeniusz Nowicki, Czeslaw Smutnicki

Eur. J. Oper. Res., 2006

2005

An Advanced Tabu Search Algorithm for the Job Shop Problem.

Eugeniusz Nowicki, Czeslaw Smutnicki

J. Sched., 2005

2004

2D and 3D Representations of Solution Spaces for CO Problems.

Eugeniusz Nowicki, Czeslaw Smutnicki

Proceedings of the Computational Science, 2004

1999

The permutation flow shop with buffers: A tabu search approach.

Eugeniusz Nowicki

Eur. J. Oper. Res., 1999

1998

The flow shop with parallel machines: A tabu search approach.

Eugeniusz Nowicki, Czeslaw Smutnicki

Eur. J. Oper. Res., 1998

1995

A Bicriterion Approach to Preemptive Scheduling of Parallel Machines with Controllable Job Processing Times.

Eugeniusz Nowicki, Stanislaw Zdrzalka

Discret. Appl. Math., 1995

1994

An Approximation Algorithm for a Single-Machine Scheduling Problem with Release Times and Delivery Times.

Eugeniusz Nowicki, Czeslaw Smutnicki

Discret. Appl. Math., 1994

1993

New Results in the Worst-Case Analysis for Flow-Shop Scheduling.

Eugeniusz Nowicki, Czeslaw Smutnicki

Discret. Appl. Math., 1993

1991

Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling.

Eugeniusz Nowicki, Czeslaw Smutnicki

Oper. Res. Lett., 1991

1990

A survey of results for sequencing problems with controllable processing times.

Eugeniusz Nowicki, Stanislaw Zdrzalka

Discret. Appl. Math., 1990