Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
type: Item
instance of: scholarly article
title: Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
zbMATH Open document ID: 1380.90061
author: André Scholz
author: Daniel Schubert
author: Gerhard Wäscher
published in: European Journal of Operational Research
publication date: 2018-02-06T00:00:00Z
full work available at URL: 2016 05.pdf
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6835143
zbMATH Keywords: traveling salesman
zbMATH Keywords: order batching
zbMATH Keywords: batch sequencing
zbMATH Keywords: picker routing
zbMATH Keywords: variable neighborhood descent
describes a project that uses: LKH
MaRDI profile type: Publication
OpenAlex ID: W2565646189
cites work: Order batching in walk-and-pick order picking systems
cites work: Variable neighborhood search: Principles and applications
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: Design and control of warehouse order picking: a literature review
cites work: The Total Tardiness Problem: Review and Extensions
cites work: Compact formulations of the Steiner traveling salesman problem and related problems
cites work: Scheduling
cites work: Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
cites work: Routing methods for warehouses with multiple cross aisles
cites work: Routing order pickers in a warehouse with a middle aisle
cites work: A new mathematical programming formulation for the single-picker routing problem
cites work: Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing
cites work: Using a TSP heuristic for routing order pickers in warehouses
cites work: Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
cites work: Integrated machine scheduling and vehicle routing with time windows
DOI: 10.1016/J.EJOR.2017.04.038
Recommended article: An efficient and general approach for the joint order batching and picker routing problem
Recommended article: Optimally solving the joint order batching and picker routing problem
Recommended article: On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm
Recommended article: Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories
Recommended article: Q5166018
Recommended article: A rule-based heuristic algorithm for on-line order batching and scheduling in an order picking warehouse with multiple pickers
Recommended article: The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem
Recommended article: Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
Recommended article: A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices
Recommended article: Q4984745
description: scientific article; zbMATH DE number 6835143