default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRico Walter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Philipp Schulze, Armin Scholl, Rico Walter:
R-SALSA: A branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines. Eur. J. Oper. Res. 312(1): 38-55 (2024)- 2023
- [j16]Philipp Schulze, Rico Walter:
A note on the exact solution of the minimum squared load assignment problem. Comput. Oper. Res. 159: 106309 (2023) - 2022
- [j15]Rico Walter, Philipp Schulze:
On the performance of task-oriented branch-and-bound algorithms for workload smoothing in simple assembly line balancing. Int. J. Prod. Res. 60(15): 4654-4667 (2022) - 2021
- [j14]Rico Walter, Philipp Schulze, Armin Scholl:
SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing. Eur. J. Oper. Res. 295(3): 857-873 (2021) - 2020
- [j13]Rico Walter:
A note on "Workload smoothing in simple assembly line balancing". Comput. Oper. Res. 113 (2020) - [j12]Rico Walter, Alexander Lawrinenko:
A characterization of optimal multiprocessor schedules and new dominance rules. J. Comb. Optim. 40(4): 876-900 (2020)
2010 – 2019
- 2019
- [j11]Alexander Fröhlich von Elmbach, Armin Scholl, Rico Walter:
Minimizing the maximal ergonomic burden in intra-hospital patient transportation. Eur. J. Oper. Res. 276(3): 840-854 (2019) - 2018
- [j10]Stefan Schwerdfeger
, Rico Walter:
Improved algorithms to minimize workload balancing criteria on identical parallel machines. Comput. Oper. Res. 93: 123-134 (2018) - [j9]Alexander Lawrinenko, Stefan Schwerdfeger, Rico Walter:
Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max-min ki -partitioning problem. J. Heuristics 24(2): 173-203 (2018) - 2017
- [j8]Rico Walter:
A note on minimizing the sum of squares of machine completion times on two identical parallel machines. Central Eur. J. Oper. Res. 25(1): 139-144 (2017) - [j7]Rico Walter, Alexander Lawrinenko:
Lower bounds and algorithms for the minimum cardinality bin covering problem. Eur. J. Oper. Res. 256(2): 392-403 (2017) - [j6]Alena Otto, Nils Boysen, Armin Scholl, Rico Walter:
Ergonomic workplace design in the fast pick area. OR Spectr. 39(4): 945-975 (2017) - [j5]Rico Walter, Martin Wirth, Alexander Lawrinenko:
Improved approaches to the exact solution of the machine covering problem. J. Sched. 20(2): 147-164 (2017) - 2016
- [j4]Stefan Schwerdfeger, Rico Walter:
A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines. Comput. Oper. Res. 73: 84-91 (2016) - 2014
- [j3]Rico Walter, Alexander Lawrinenko:
A note on minimizing the normalized sum of squared workload deviations on m parallel processors. Comput. Ind. Eng. 75: 257-259 (2014) - 2013
- [j2]Rico Walter:
Comparing the minimum completion times of two longest-first scheduling-heuristics. Central Eur. J. Oper. Res. 21(1): 125-139 (2013) - [j1]Rico Walter, Nils Boysen, Armin Scholl:
The discrete forward-reserve problem - Allocating space, selecting products, and area sizing in forward order picking. Eur. J. Oper. Res. 229(3): 585-594 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
