On the public citation graph

Picking Operations in Warehouses With Dynamically Arriving Orders: How Good is Reoptimization?

0 signed · 45 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118165881.ch7openalex-snapshot
Comparing Variables of Ordinal or Dichotomous Scales: Spearman Rank‐Order, Point‐Biserial, and Biserial Correlations
inferredcites →https://doi.org/10.1002/nav.5openalex-snapshot
On‐line algorithms for minimizing makespan on batch processing machines
inferredcites →https://doi.org/10.1002/net.20180openalex-snapshot
Competitive analysis for dynamic multiperiod uncapacitated routing problems
inferredcites →https://doi.org/10.1002/net.20454openalex-snapshot
Online traveling salesman problems with service flexibility
inferredcites →https://doi.org/10.1002/net.21559openalex-snapshot
Online traveling salesman problems with rejection options
inferredcites →https://doi.org/10.1002/net.21799openalex-snapshot
Online scheduling with multi‐state machines
inferredcites →https://doi.org/10.1007/3-540-46541-3_53openalex-snapshot
Online Dial-a-Ride Problems: Minimizing the Completion Time
inferredcites →https://doi.org/10.1007/978-3-319-55511-9openalex-snapshot
Approximate Dynamic Programming for Dynamic Vehicle Routing
inferredcites →https://doi.org/10.1007/bfb0029561openalex-snapshot
Online Algorithms
inferredcites →https://doi.org/10.1007/s004530010071openalex-snapshot
Algorithms for the On-Line Travelling Salesman1
inferredcites →https://doi.org/10.1016/j.apm.2016.12.012openalex-snapshot
On-line order batching and sequencing problem with multiple pickers: A hybrid rule-based algorithm
inferredcites →https://doi.org/10.1016/j.cie.2016.02.001openalex-snapshot
Integrated on-line scheduling of order batching and delivery under B2C e-commerce
inferredcites →https://doi.org/10.1016/j.cie.2021.107221openalex-snapshot
Solving the online batching problem using deep reinforcement learning
inferredcites →https://doi.org/10.1016/j.cor.2011.12.019openalex-snapshot
Algorithms for on-line order batching in an order picking warehouse
inferredcites →https://doi.org/10.1016/j.ejor.2005.03.052openalex-snapshot
Travel time estimation and order batching in a 2-block warehouse
inferredcites →https://doi.org/10.1016/j.ejor.2008.09.011openalex-snapshot
The impact of order batching and picking area zoning on order picking system performance
inferredcites →https://doi.org/10.1016/j.ejor.2011.12.041openalex-snapshot
Optimizing a dynamic order-picking process
inferredcites →https://doi.org/10.1016/j.ejor.2015.06.074openalex-snapshot
An algorithm for dynamic order-picking in warehouse operations
inferredcites →https://doi.org/10.1016/j.ejor.2017.03.069openalex-snapshot
Optimally solving the joint order batching and picker routing problem
inferredcites →https://doi.org/10.1016/j.ejor.2018.08.023openalex-snapshot
Warehousing in the e-commerce era: A survey
inferredcites →https://doi.org/10.1016/j.ejor.2019.03.012openalex-snapshot
Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
inferredcites →https://doi.org/10.1016/j.ejor.2021.05.033openalex-snapshot
Order batching and batch sequencing in an AMR-assisted picker-to-parts system
inferredcites →https://doi.org/10.1016/j.ejor.2022.08.047openalex-snapshot
Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses
inferredcites →https://doi.org/10.1016/j.ejor.2023.02.019openalex-snapshot
Order batching problems: Taxonomy and literature review
inferredcites →https://doi.org/10.1016/j.ijpe.2009.01.013openalex-snapshot
Evaluating order throughput time in 2-block warehouses with time window batching
inferredcites →https://doi.org/10.1016/j.ijpe.2014.09.029openalex-snapshot
An efficient hybrid algorithm for integrated order batching, sequencing and routing problem
inferredcites →https://doi.org/10.1016/j.ijpe.2017.04.002openalex-snapshot
An interventionist strategy for warehouse order picking: Evidence from two case studies
inferredcites →https://doi.org/10.1016/j.tre.2011.10.010openalex-snapshot
Throughput time distribution analysis for a one-block warehouse
inferredcites →https://doi.org/10.1016/s0166-218x(00)00181-5openalex-snapshot
Scheduling one batch processor subject to job release dates
inferredcites →https://doi.org/10.1051/ro/2018069openalex-snapshot
A rule-based heuristic algorithm for on-line order batching and scheduling in an order picking warehouse with multiple pickers
inferredcites →https://doi.org/10.1080/00207543.2021.1961037openalex-snapshot
Real-time order picking planning framework for warehouses and distribution centres
inferredcites →https://doi.org/10.1080/00207543.2022.2053223openalex-snapshot
Practical factors in order picking planning: state-of-the-art classification and review
inferredcites →https://doi.org/10.1080/00207543.2022.2078747openalex-snapshot
Integrated scheduling of order picking operations under dynamic order arrivals
inferredcites →https://doi.org/10.1080/07408170802167613openalex-snapshot
Performance approximation and design of pick-and-pass order picking systems
inferredcites →https://doi.org/10.1080/13675567.2014.945400openalex-snapshot
Investigating order picking system adoption: a case-study-based approach
inferredcites →https://doi.org/10.1111/j.1937-5956.2009.01047.xopenalex-snapshot
A Flexible Evaluative Framework for Order Picking Systems
inferredcites →https://doi.org/10.1287/ijoc.2021.1060openalex-snapshot
Picker Routing in AGV-Assisted Order Picking Systems
inferredcites →https://doi.org/10.1287/mnsc.2021.4275openalex-snapshot
Optimal Picking Policies in E-Commerce Warehouses
inferredcites →https://doi.org/10.1287/opre.1070.0450openalex-snapshot
Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
inferredcites →https://doi.org/10.1287/opre.41.1.60openalex-snapshot
Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
inferredcites →https://doi.org/10.1287/trsc.2023.1207openalex-snapshot
Human-Robot Cooperation: Coordinating Autonomous Mobile Robots and Human Order Pickers
inferredcites →https://doi.org/10.3390/jtaer17040091openalex-snapshot
Order-Picking Efficiency in E-Commerce Warehouses: A Literature Review
inferredcites →https://doi.org/10.48550/arxiv.2410.14316openalex-snapshot
On picking operations in e-commerce warehouses: Insights from the complete-information counterpart

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.5281/zenodo.23845532zenodo-depositor-declared
inferred← citeshttps://doi.org/10.1016/j.tre.2025.104082openalex-snapshot
Collaborative Human–Robot Teaming for Dynamic Order Picking: Interventionist strategies for improving warehouse intralogistics operations
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.