Publikationen Dr. Rico Walter

Bücher

  • Walter, R. (2010): Analyzing Various Aspects of Scheduling Independent Jobs on Identical Machines. Logos, Berlin.

Referierte Zeitschriftenartikel

  • Schulze, P.; Scholl, A.; Walter, R. (2024): R-SALSA: A branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines. European Journal of Operational Research 312/1, 38-55.
  • Schulze, P.; Walter, R. (2023): A note on the exact solution of the minimum squared load assignment problem. Computers & Operations Research 159, 106309.
  • Walter, R.; Schulze, P. (2022): On the performance of task-oriented branch-and-bound algorithms for workload smoothing in simple assembly line balancing. International Journal of Production Research 60/15, 4654–4667.
  • Walter, R.; Schulze, P.; Scholl, A. (2021): SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing. European Journal of Operational Research 295/3, 857–873.
  • Walter, R.; Lawrinenko, A. (2020): A characterization of optimal multiprocessor schedules and new dominance rules. Journal of Combinatorial Optimization 40, 876–900.
  • Walter, R. (2020): A note on "Workload smoothing in simple assembly line balancing". Computers & Operations Research 113, 104803.
  • Fröhlich von Elmbach, A.; Scholl, A.; Walter, R. (2019): Minimizing the maximal ergonomic burden in intra-hospital patient transportation. European Journal of Operational Research 276/3, 840–854.
  • Schwerdfeger, S.; Walter, R. (2018): Improved algorithms to minimize workload balancing criteria on identical parallel machines. Computers & Operations Research 93, 123–134.
  • Lawrinenko, A.; Schwerdfeger, S.; Walter, R. (2018): Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max-min k_i-partitioning problem. Journal of Heuristics 24/2, 173–203.
  • Otto, A.; Boysen, N.; Scholl, A.; Walter, R. (2017): Ergonomic workplace design in the fast pick area. Operations Research Spectrum 39/4, 945–975.
  • Walter, R.; Lawrinenko, A. (2017): Lower bounds and algorithms for the minimum cardinality bin covering problem. European Journal of Operational Research 256/2, 392–403.
  • Walter, R.; Wirth, M.; Lawrinenko, A. (2017): Improved approaches to the exact solution of the machine covering problem. Journal of Scheduling 20/2, 147–164.
  • Walter, R. (2017): A note on minimizing the sum of squares of machine completion times on two identical parallel machines. Central European Journal of Operations Research 25/1, 139–144.
  • Schwerdfeger, S.; Walter, R. (2016): A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines. Computers & Operations Research 73, 84–91.
  • Walter, R.; Lawrinenko, A. (2014): A note on minimizing the normalized sum of squared workload deviations on m parallel processors. Computers & Industrial Engineering 75/C, 257–259.
  • Walter, R.; Boysen, N.; Scholl, A. (2013): The discrete forward-reserve problem – Allocating space, selecting products, and area sizing in forward order picking. European Journal of Operational Research 229/3, 585–594.
  • Walter, R. (2013): Comparing the minimum completion times of two longest-first scheduling-heuristics. Central European Journal of Operations Research 21/1, 125–139.