A survey of results for sequencing problems with controllable processing times. - Eugeniusz Nowicki; Stanislaw Zdrzalka (Discret. Appl. Math., 1990)

Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling. - Eugeniusz Nowicki; Czeslaw Smutnicki (Oper. Res. Lett., 1991)

New Results in the Worst-Case Analysis for Flow-Shop Scheduling. - Eugeniusz Nowicki; Czeslaw Smutnicki (Discret. Appl. Math., 1993)

An Approximation Algorithm for a Single-Machine Scheduling Problem with Release Times and Delivery Times. - Eugeniusz Nowicki; Czeslaw Smutnicki (Discret. Appl. Math., 1994)

A Bicriterion Approach to Preemptive Scheduling of Parallel Machines with Controllable Job Processing Times. - Eugeniusz Nowicki; Stanislaw Zdrzalka (Discret. Appl. Math., 1995)

The flow shop with parallel machines: A tabu search approach. - Eugeniusz Nowicki; Czeslaw Smutnicki (Eur. J. Oper. Res., 1998)

The permutation flow shop with buffers: A tabu search approach. - Eugeniusz Nowicki (Eur. J. Oper. Res., 1999)

2D and 3D Representations of Solution Spaces for CO Problems. - Eugeniusz Nowicki; Czeslaw Smutnicki (International Conference on Computational Science, 2004)

An Advanced Tabu Search Algorithm for the Job Shop Problem. - Eugeniusz Nowicki; Czeslaw Smutnicki (J. Sched., 2005)

Some aspects of scatter search in the flow-shop problem. - Eugeniusz Nowicki; Czeslaw Smutnicki (Eur. J. Oper. Res., 2006)