Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 32Scheduling and Optimization AlgorithmsAdvanced Manufacturing and Logistics OptimizationHealthcare Operations and Scheduling Optimization

The DOI matches its Crossref record; the references it cites are not checked yet.

Improving warehouse responsiveness by job priority management: A European distribution centre field study

Open access
Kim, Thai Young·2020·Computers & Industrial Engineering
DOI 10.1016/j.cie.2018.12.011
Open this paper in CoChat — free account

Abstract

Abstract Warehouses employ order cut-off times to ensure sufficient time for fulfilment. To satisfy increasing consumer’s expectations for higher order responsiveness, warehouses competitively postpone these cut-off times upholding the same pick-up time. This paper, therefore, aims to schedule jobs more efficiently to meet compressed response times. Secondly, this paper provides a data-driven decision-making methodology to guarantee the right implementation by the practitioners. Priority-based job scheduling using flow-shop models has been used mainly for manufacturing systems but can be ingeniously applied for warehouse job scheduling to accommodate tighter cut-off times. To assist warehouse managers in decision making for the practical value of these models, this study presents a computer simulation approach to decide which priority rule performs best under which circumstances. The application of stochastic simulation models for uncertain real-life operational environments contributes to the previous literature on deterministic models for theoretical environments. The performance of each rule is evaluated in terms of a joint cost criterion that integrates the objectives of low earliness, low tardiness, low labour idleness, and low work-in-process stocks. The simulation outcomes provide several findings about the strategic views for improving responsiveness. In particular, the critical ratio rule using the real-time queue status of jobs has the fastest flow-time and performs best for warehouse scenarios with expensive products and high labour costs. The case study limits the coverage of the findings, but it still closes the existent gap regarding data-driven decision making methodology for practitioners of supply chains.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.cie.2018.12.011

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

The citation lists are queued

They are fetched later and appear here then.

References 55 · Cited by 32

Research works printed but not linked: 50

  1. Baker, 1990, Sequencing with earliness and tardiness penalties: A review, Operations Research, 38, 22, 10.1287/opre.38.1.22 · doi:10.1287/opre.38.1.22
  2. Berry, 1975, Critical ratio scheduling: An experimental analysis, Management Science, 22, 192, 10.1287/mnsc.22.2.192 · doi:10.1287/mnsc.22.2.192
  3. Burke, 1956, The output of a queuing system, Operations Research, 4, 699, 10.1287/opre.4.6.699 · DOI · Paper page
  4. Cakici, 2012, Multi-objective analysis of an integrated supply chain scheduling problem, International Journal of Production Research, 50, 2624, 10.1080/00207543.2011.578162 · doi:10.1080/00207543.2011.578162
  5. Chen, 2010, A flexible evaluative framework for order picking systems, Production and Operations Management, 19, 70, 10.1111/j.1937-5956.2009.01047.x · DOI
  6. Cui, 2018, A proactive approach to solve integrated production scheduling and maintenance planning problem in flow shops, Computers & Industrial Engineering, 115, 342, 10.1016/j.cie.2017.11.020 · DOI
  7. De Koster, 2008, Benchmarking and monitoring international warehouse operations in Europe, Production and Operations Management, 17, 175, 10.3401/poms.1080.0013 · doi:10.3401/poms.1080.0013
  8. De Koster, 2007, Design and control of warehouse order picking: A literature review, European Journal of Operational Research, 182, 481, 10.1016/j.ejor.2006.07.009 · DOI · Paper page
  9. De Koster, 2012, Determining the number of zones in a pick-and-sort order picking system, International Journal of Production Research, 50, 757, 10.1080/00207543.2010.543941 · doi:10.1080/00207543.2010.543941
  10. De Leeuw, 2015, Warehouse manpower planning strategies in times of financial crisis: Evidence from logistics service providers and retailers in the Netherlands, Production Planning & Control, 26, 328, 10.1080/09537287.2014.904531 · DOI
  11. Deng, 2012, A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion, Computers & Operations Research, 39, 2152, 10.1016/j.cor.2011.10.024 · DOI
  12. Doerr, 2013, A performance metric and goal-setting procedure for deadline-oriented processes, Production and Operations Management, 22, 726, 10.1111/j.1937-5956.2012.01375.x · DOI
  13. Elsayed, 1993, Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals, The International Journal of Production Research, 31, 727, 10.1080/00207549308956753 · DOI
  14. Freiheit, 2017, The effect of work content imbalance and its interaction with scheduling method on sequential flow line performance, International Journal of Production Research, 55, 2791, 10.1080/00207543.2016.1194536 · doi:10.1080/00207543.2016.1194536
  15. Giannakis, 2016, A multi-agent based system with big data processing for enhanced supply chain agility, Journal of Enterprise Information Management, 29, 706, 10.1108/JEIM-06-2015-0050 · DOI · Paper page
  16. Gong, 2011, A review on stochastic models and analysis of warehouse operations, Logistics Research, 3, 191, 10.1007/s12159-011-0057-6 · DOI
  17. Graves, 1977, Storage-retrieval interleaving in automatic warehousing systems, Management Science, 23, 935, 10.1287/mnsc.23.9.935 · DOI
  18. Györgyi, 2018, Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut, Computers & Industrial Engineering, 115, 220, 10.1016/j.cie.2017.11.016 · doi:10.1016/j.cie.2017.11.016
  19. Hackman, 2001, Benchmarking warehousing and distribution operations: An input-output approach, Journal of Productivity Analysis, 16, 79, 10.1023/A:1011155320454 · doi:10.1023/a:1011155320454
  20. Hall, 1993, Distance approximations for routing manual pickers in a warehouse, IIE Transactions, 25, 76, 10.1080/07408179308964306 · DOI
  21. Huang, 2006, The workload balancing problem at aircargo terminals, OR Spectrum, 28, 705, 10.1007/s00291-006-0035-6 · doi:10.1007/s00291-006-0035-6
  22. Jarvis, 1991, Optimal product layout in an order picking warehouse, IIE Transactions, 23, 93, 10.1080/07408179108963844 · DOI
  23. Johnson, 1954, Optimal two-and three-stage production schedules with setup times included, Naval Research Logistics, 1, 61, 10.1002/nav.3800010110 · DOI · Paper page
  24. Kanet, 1982, Priority dispatching with operation due dates in a job shop, Journal of Operations Management, 2, 167, 10.1016/0272-6963(82)90004-3 · doi:10.1016/0272-6963(82)90004-3
  25. Kheirandish, 2015, An artificial bee colony algorithm for a two-stage hybrid flowshop scheduling problem with multilevel product structures and requirement operations, International Journal of Computer Integrated Manufacturing, 28, 437, 10.1080/0951192X.2014.880805 · doi:10.1080/0951192x.2014.880805
  26. Kiran, 1984, Simulation studies in job shop sheduling—I a survey, Computers & Industrial Engineering, 8, 87, 10.1016/0360-8352(84)90001-9 · doi:10.1016/0360-8352(84)90001-9
  27. Krafcik, 1988, Triumph of the lean production system, Sloan Management Review, 30, 41
  28. Kritchanchai, 1999, Responsiveness of the order fulfilment process, International Journal of Operations & Production Management, 19, 812, 10.1108/01443579910274419 · doi:10.1108/01443579910274419
  29. Lee, 1997, Job shop scheduling with a genetic algorithm and machine learning, International Journal of Production Research, 35, 1171, 10.1080/002075497195605 · doi:10.1080/002075497195605
  30. Leung, 2018, A B2C e-commerce intelligent system for re-engineering the e-order fulfilment process, Expert Systems with Applications, 91, 386, 10.1016/j.eswa.2017.09.026 · DOI
  31. Little, 1961, A proof for the queuing formula: L=λW, Operations Research, 9, 383, 10.1287/opre.9.3.383 · DOI · Paper page
  32. Nesello, 2018, Mathematical models and decomposition algorithms for makespan minimization in plastic rolls production, Journal of the Operational Research Society, 69, 326, 10.1057/s41274-017-0221-8 · DOI
  33. Pagh, 1998, Supply chain postponement and speculation strategies: How to choose the right strategy, Journal of Business Logistics, 19, 13
  34. Petersen, 1997, An evaluation of order picking routeing policies, International Journal of Operations & Production Management, 17, 1098, 10.1108/01443579710177860 · DOI
  35. Petersen, 2000, An evaluation of order picking policies for mail order companies, Production and Operations Management, 9, 319, 10.1111/j.1937-5956.2000.tb00461.x · DOI
  36. Petersen, 2004, Improving order-picking performance through the implementation of class-based storage, International Journal of Physical Distribution & Logistics Management, 34, 534, 10.1108/09600030410552230 · DOI
  37. Putnam, 1971, Updating critical ratio and slack time priority scheduling rules, Production and Inventory Management, 12, 51
  38. Ramaa, 2012, Impact of warehouse management system in a supply chain, International Journal of Computer Applications, 54
  39. Ramasesh, 1990, Dynamic job shop scheduling: A survey of simulation research, Omega, 18, 43, 10.1016/0305-0483(90)90017-4 · doi:10.1016/0305-0483(90)90017-4
  40. Roodbergen, 2001, Routing methods for warehouses with multiple cross aisles, International Journal of Production Research, 39, 1865, 10.1080/00207540110028128 · DOI
  41. Shahrabi, 2017, A reinforcement learning approach to parameter estimation in dynamic job shop scheduling, Computers & Industrial Engineering, 110, 75, 10.1016/j.cie.2017.05.026 · DOI · Paper page
  42. Smith, 1956, Various optimizers for single-stage production, Naval Research Logistics, 3, 59, 10.1002/nav.3800030106 · DOI · Paper page
  43. Treleven, 1985, An investigation of labor assignment rules in a dual-constrained job shop, Journal of Operations Management, 6, 51, 10.1016/0272-6963(85)90035-X · DOI
  44. Van den Berg, 1999, A literature survey on planning and control of warehousing systems, IIE Transactions, 31, 751, 10.1080/07408179908969874 · DOI
  45. Van Nieuwenhuyse, 2009, Evaluating order throughput time in 2-block warehouses with time window batching, International Journal of Production Economics, 121, 654, 10.1016/j.ijpe.2009.01.013 · doi:10.1016/j.ijpe.2009.01.013
  46. Vincent, 2011, Multicriteria models for just-in-time scheduling, International Journal of Production Research, 49, 3191, 10.1080/00207541003733783 · DOI
  47. Wang, 2014, Two-stage hybrid flow shop scheduling with preventive maintenance using multi-objective tabu search method, International Journal of Production Research, 52, 1495, 10.1080/00207543.2013.847983 · DOI
  48. Welch, 1947, The generalization of ‘Student'’s problem when several different population variances are involved, Biometrika, 34, 28, 10.2307/2332510 · DOI · Paper page
  49. Won, 2005, Joint order batching and order picking in warehouse operations, International Journal of Production Research, 43, 1427, 10.1080/00207540410001733896 · DOI
  50. Yazdani, 2017, Optimizing the sum of maximum earliness and tardiness of the job shop scheduling problem, Computers & Industrial Engineering, 107, 12, 10.1016/j.cie.2017.02.019 · doi:10.1016/j.cie.2017.02.019

Metadata

Authors
Kim, T. Y.
Affiliations
Samsung Electronics (South Korea) (KR)
Corresponding author
Kim, Thai Young
ORCID
Kim, Thai Young
Venue
Computers & Industrial Engineering
Publisher
Elsevier BV
Published
2020-01
Volume
139
Pages
105564
ISSN
0360-8352 (ISSN-L)
DOI
10.1016/j.cie.2018.12.011
OpenAlex
W2789756536
Cited by
32
References
55
Citations by year
2026: 2 · 2025: 7 · 2024: 9 · 2023: 3 · 2022: 3 · 2021: 4 · 2020: 1
FWCI
1.35
Type
journal article
Language
en
Open access
Licence
  • other-oa
  • www.elsevier.com/tdm/userlicense/1.0/ (tdm)
  • www.elsevier.com/legal/tdmrep-license (tdm)
Locations
  • Computers & Industrial Engineering (publishedVersion)
  • Middlesex University Research Repository (Middlesex University Of London) (acceptedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • Econometric Institute Research Papers (submittedVersion)
  • EUR Research Repository (Erasmus University Rotterdam) (submittedVersion, other-oa)
  • RePub (Erasmus University Rotterdam) (submittedVersion, other-oa)
Topics
  • Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Scheduling and Optimization Algorithms
  • Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Advanced Manufacturing and Logistics Optimization
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Healthcare Operations and Scheduling Optimization
Keywords
dispatching rules, flow shop scheduling, stochastic simulation, earliness and tardiness, work-in-process inventory, distribution centers, data-driven decision making

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Improving warehouse responsiveness by job priority management: A European distribution centre field study. https://app.cochat.ai/papers/10.1016/j.cie.2018.12.011
The paper
Kim, T. Y. (2020). Improving warehouse responsiveness by job priority management: A European distribution centre field study. Computers & Industrial Engineering. https://doi.org/10.1016/j.cie.2018.12.011

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.