Worker Scheduling in a Multi-depot Warehouse Employing Pick-pack Switching Policy

Order picking and packing are two essential operations in the order fulfillment process, where workers can be allocated and scheduled under different policies. This study focuses on a pick-pack switching policy in a picking and packing wave of a multi-depot warehouse to shorten its completion time. All workers are responsible for the order picking task at the beginning, and then some move to packing stations for packing. We formulate the worker scheduling problem and propose a simulated annealing algorithm initialized by a backward scheduling to effectively solve the problem within a short computational time. The experimental results demonstrate that the pick-pack switching policy accelerates the completion time of a wave compared to the monotasking policy. Additionally, our proposed algorithm provides efficient solutions, achieving an acceptable difference from the weak lower bound.

Authors

Publication Details

Journal
Journal of Korean Institute of Industrial Engineers
Published
2025-04-15
DOI
https://doi.org/10.7232/jkiie.2025.51.2.142
Primary Topic
Advanced Manufacturing and Logistics Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Worker Scheduling in a Multi-depot Warehouse Employing Pick-pack Switching Policy

Thao Huong Tran-Vo, Soondo Hong, Giyeol Lee
Journal of Korean Institute of Industrial Engineers
Advanced Manufacturing and Logistics Optimization
article

Worker Scheduling in a Multi-depot Warehouse Employing Pick-pack Switching Policy

Thao Huong Tran-Vo, Soondo Hong, Giyeol Lee
article en

Abstract

Order picking and packing are two essential operations in the order fulfillment process, where workers can be allocated and scheduled under different policies. This study focuses on a pick-pack switching policy in a picking and packing wave of a multi-depot warehouse to shorten its completion time. All workers are responsible for the order picking task at the beginning, and then some move to packing stations for packing. We formulate the worker scheduling problem and propose a simulated annealing algorithm initialized by a backward scheduling to effectively solve the problem within a short computational time. The experimental results demonstrate that the pick-pack switching policy accelerates the completion time of a wave compared to the monotasking policy. Additionally, our proposed algorithm provides efficient solutions, achieving an acceptable difference from the weak lower bound.

Journal of Korean Institute of Industrial EngineersVol. 51(2)
Decent work and economic growth
Openalex Percentile: Top 88%
Advanced Manufacturing and Logistics Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.