Order Batching in Warehouses by Minimizing Total Tardiness: A Hybrid Approach of Weighted Association Rule Mining and Genetic Algorithms
One of the cost-intensive issues in managing warehouses is the order picking problem which deals with the retrieval of items from their storage locations in order to meet customer requests. Many solution approaches have been proposed in order to minimize traveling distance in the process of order pi...
Saved in:
Main Authors: | Amir Hossein Azadnia, Shahrooz Taheri, Pezhman Ghadimi, Muhamad Zameri Mat Saman, Kuan Yew Wong |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2013/246578 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A novel mathematical model with an LCA-based solution method to minimize earliness-tardiness costs on a single machine by considering batch delivery
by: Zahra Pourali, et al.
Published: (2025-03-01) -
Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents
by: Wen-Chiung Lee, et al.
Published: (2014-01-01) -
A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems
by: Chia-Shin Chung, et al.
Published: (2012-01-01) -
Developing heuristic and meta-heuristic algorithms for the problem of joint order batching and collector routing in single and multiple-cross-aisle warehouses
by: Zahra Shamlou, et al.
Published: (2024-08-01) -
Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan
by: Cuixia Miao
Published: (2014-01-01)