The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
An association-based clustering approach to order batching considering customer demand patterns
Open accessAbstract
Research on warehousing systems has gained interest since the 1980s, reflecting the fact that supply chain management has pursued a demand-driven organization with high product variety, small order sizes, and reliable short response times throughout the supply chain. This market trend has affected warehouse management and operations tremendously. Order batching in a warehouse attempts to achieve high-volume order processing operations by consolidating small orders into batches. Order batching is an essential operation of order processing in which several orders are grouped into batches. This paper describes the development of an order batching approach based on data mining and integer programming. It is valuable to discover the important associations between orders such that the occurrence of some orders in a batch will cause the occurrence of other orders in the same batch. An order-clustering model based on 0–1 integer programming can be formulated to maximize the associations between orders within each batch. From the results of several test problems, the proposed approach shows its ability to find quality solutions of order batching problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Cited by
Research on warehouse operation: A comprehensive review
Gu, J., Goetschalckx, M., & McGinnis, L. F. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.02.025 · Cited by 965
Data mining in manufacturing: a review based on the kind of knowledge
Choudhary, A. K., Harding, J. A., & Tiwari, M. K. (2009) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-008-0145-x · Cited by 494
Design and control of warehouse order picking: A literature review
de Koster, R., Le-Duc, T., & Roodbergen, K. J. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.07.009 · Cited by 114
Metadata
- Authors
- CHEN, M., & WU, H.
- Venue
- Omega
- Publisher
- Elsevier BV
- Published
- 2005-08
- Volume
- 33
- Issue
- 4
- Pages
- 333-343
- ISSN
- 0305-0483 (ISSN-L)
- OpenAlex
- W2091550641
- Cited by
- 185
- References
- 1
- FWCI
- 16.14
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.