An algorithm for single machine sequencing with release dates to minimize maximum cost. - Stanislaw Zdrzalka; Józef Grabowski (Discret. Appl. Math., 1989)

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

Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis. - Stanislaw Zdrzalka (Oper. Res. Lett., 1991)

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

A Sequencing Problem with Family Setup Times. - Stanislaw Zdrzalka (Discret. Appl. Math., 1996)