Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem. - Wlodzimierz Szwarc (Oper. Res., 1973)

Letter to the Editor - Remarks. - Wlodzimierz Szwarc (Oper. Res., 1975)

Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem. - Wlodzimierz Szwarc (Oper. Res., 1977)

Technical Note - Dominance Conditions for the Three-Machine Flow-Shop Problem. - Wlodzimierz Szwarc (Oper. Res., 1978)

Technical Note - Precedence Relations of the Flow-Shop Problem. - Wlodzimierz Szwarc (Oper. Res., 1981)

The Caterer Problem. - Wlodzimierz Szwarc; Marc E. Posner (Oper. Res., 1985)

The flow shop problem with time lags and separated setup times. - Wlodzimierz Szwarc (Z. Oper. Research, 1986)

Generating improved dominance conditions for the flowshop problem. - Jatinder N. D. Gupta; J. George Shanthikumar; Wlodzimierz Szwarc (Comput. Oper. Res., 1987)

The clustered flow-shop problem. - Wlodzimierz Szwarc (ZOR Methods Model. Oper. Res., 1988)

An approximate solution of the flow-shop problem with sequence dependent setup times. - Wlodzimierz Szwarc; John J. Liu (ZOR Methods Model. Oper. Res., 1989)

An instant solution of the 2 × n bottleneck transportation problem. - Wlodzimierz Szwarc (Oper. Res. Lett., 1993)

The weighted common due date single machine scheduling problem revisited. - Wlodzimierz Szwarc (Comput. Oper. Res., 1996)

Clustered flow shop models. - Wlodzimierz Szwarc (J. Glob. Optim., 1996)

Earliness and tardiness single machine scheduling with proportional weights. - Wlodzimierz Szwarc; Samar K. Mukhopadhyay (J. Glob. Optim., 1996)

Decomposition of the single machine total tardiness problem. - Wlodzimierz Szwarc; Samar K. Mukhopadhyay (Oper. Res. Lett., 1996)

Decomposition in single-machine scheduling. - Wlodzimierz Szwarc (Ann. Oper. Res., 1998)

Some remarks on the decomposition properties of the single machine total tardiness problem. - Wlodzimierz Szwarc (Eur. J. Oper. Res., 2007)