Comparing the minimum completion times of two longest-first scheduling-heuristics. - Rico Walter (Central Eur. J. Oper. Res., 2013)

The discrete forward-reserve problem - Allocating space, selecting products, and area sizing in forward order picking. - Rico Walter; Nils Boysen; Armin Scholl (Eur. J. Oper. Res., 2013)

A note on minimizing the normalized sum of squared workload deviations on m parallel processors. - Rico Walter; Alexander Lawrinenko (Comput. Ind. Eng., 2014)

A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines. - Stefan Schwerdfeger; Rico Walter (Comput. Oper. Res., 2016)

A note on minimizing the sum of squares of machine completion times on two identical parallel machines. - Rico Walter (Central Eur. J. Oper. Res., 2017)

Lower bounds and algorithms for the minimum cardinality bin covering problem. - Rico Walter; Alexander Lawrinenko (Eur. J. Oper. Res., 2017)

Ergonomic workplace design in the fast pick area. - Alena Otto; Nils Boysen; Armin Scholl; Rico Walter (OR Spectr., 2017)

Improved approaches to the exact solution of the machine covering problem. - Rico Walter; Martin Wirth; Alexander Lawrinenko (J. Sched., 2017)

Improved algorithms to minimize workload balancing criteria on identical parallel machines. - Stefan Schwerdfeger; Rico Walter (Comput. Oper. Res., 2018)

Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max-min ki -partitioning problem. - Alexander Lawrinenko; Stefan Schwerdfeger; Rico Walter (J. Heuristics, 2018)

Minimizing the maximal ergonomic burden in intra-hospital patient transportation. - Alexander Fröhlich von Elmbach; Armin Scholl; Rico Walter (Eur. J. Oper. Res., 2019)

A note on "Workload smoothing in simple assembly line balancing". - Rico Walter (Comput. Oper. Res., 2020)

A characterization of optimal multiprocessor schedules and new dominance rules. - Rico Walter; Alexander Lawrinenko (J. Comb. Optim., 2020)

SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing. - Rico Walter; Philipp Schulze; Armin Scholl (Eur. J. Oper. Res., 2021)

On the performance of task-oriented branch-and-bound algorithms for workload smoothing in simple assembly line balancing. - Rico Walter; Philipp Schulze (Int. J. Prod. Res., 2022)

A note on the exact solution of the minimum squared load assignment problem. - Philipp Schulze; Rico Walter (Comput. Oper. Res., 2023)

R-SALSA: A branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines. - Philipp Schulze; Armin Scholl; Rico Walter (Eur. J. Oper. Res., 2024)