Rico Walter

According to our database1, Rico Walter authored at least 17 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
R-SALSA: A branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines.
Eur. J. Oper. Res., January, 2024

2023
A note on the exact solution of the minimum squared load assignment problem.
Comput. Oper. Res., November, 2023

2022
On the performance of task-oriented branch-and-bound algorithms for workload smoothing in simple assembly line balancing.
Int. J. Prod. Res., 2022

2021
SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing.
Eur. J. Oper. Res., 2021

2020
A characterization of optimal multiprocessor schedules and new dominance rules.
J. Comb. Optim., 2020

A note on "Workload smoothing in simple assembly line balancing".
Comput. Oper. Res., 2020

2019
Minimizing the maximal ergonomic burden in intra-hospital patient transportation.
Eur. J. Oper. Res., 2019

2018
Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max-min k<sub>i</sub> -partitioning problem.
J. Heuristics, 2018

Improved algorithms to minimize workload balancing criteria on identical parallel machines.
Comput. Oper. Res., 2018

2017
Improved approaches to the exact solution of the machine covering problem.
J. Sched., 2017

Ergonomic workplace design in the fast pick area.
OR Spectr., 2017

Lower bounds and algorithms for the minimum cardinality bin covering problem.
Eur. J. Oper. Res., 2017

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

2016
A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines.
Comput. Oper. Res., 2016

2014
A note on minimizing the normalized sum of squared workload deviations on m parallel processors.
Comput. Ind. Eng., 2014

2013
The discrete forward-reserve problem - Allocating space, selecting products, and area sizing in forward order picking.
Eur. J. Oper. Res., 2013

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


  Loading...