Scheduling with batching: A review
The DOI matches its Crossref record; 71 of the 72 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“the batching problem in our setting significantly differs from traditional problems (e.g., Potts and Kovalyov [2000]). When assuming that the KV cache memory limit is the sole constraint for the batch size, the number of jobs in a batch during each round varies depending on the specific jobs included in the batch.”
From Online Scheduling for LLM Inference with KV Cache Constraints (2025) · cites this paper as Potts and Kovalyov [2000]
Citations
Cites
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70356-x · Cited by 5,854
Optimal two‐ and three‐stage production schedules with setup times included
Johnson, S. M. (1954) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800010110 · Cited by 3,252
Various optimizers for single‐stage production
Smith, W. E. (1956) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800030106 · Cited by 1,831
Scheduling with Deadlines and Loss Functions
McNaughton, R. (1959) · Management Science · doi:10.1287/mnsc.6.1.1 · Cited by 848
An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
Moore, J. M. (1968) · Management Science · doi:10.1287/mnsc.15.1.102 · Cited by 828
SCHEDULING A PRODUCTION LINE TO MINIMIZE MAXIMUM TARDINESS
Jackson, J. R. (1955) · Cited by 796
Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
Lee, C., Uzsoy, R., & Martin-Vega, L. A. (1992) · Operations Research · doi:10.1287/opre.40.4.764 · Cited by 493
Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
Potts, C. N., & Wassenhove, L. N. V. (1992) · Journal of the Operational Research Society · doi:10.1057/jors.1992.66 · Cited by 449
Self-citationBrucker, P., Gladky, A. A., Hoogeveen, J. A., Kovalyov, M. Y., Potts, C. N., Tautenhahn, T., & van de Velde, S. (1998) · Journal of Scheduling · doi:10.1002/(sici)1099-1425(199806)1:1<31::aid-jos4>3.0.co;2-r · Cited by 423
Self-citationScheduling Groups of Jobs on a Single Machine
Webster, S., & Baker, K. R. (1995) · Operations Research · doi:10.1287/opre.43.4.692 · Cited by 380
Research works printed but not linked: 4
- D. Dannenberg, T. Tautenhahn, F. Werner, A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size, Preprint No. 52, Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg, Germany, 1997
- Julien, 1990, Scheduling customer orders: An alternative production scheduling approach, Journal of Manufacturing and Operations Management, 3, 177
- A.J. Mason, Genetic Algorithms and Scheduling Problems, Ph.D. Thesis, Department of Engineering, University of Cambridge, UK, 1992
- C.A. Santos, Batching and Sequencing Decisions under Lead Time Considerations for Single Machine Problems, M.Sc. Thesis, Department of Management Sciences, University of Waterloo, Canada, 1984
Cited by
A survey of scheduling problems with setup times or costs
Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.06.060 · Cited by 1,527
Self-citationThe capacitated lot sizing problem: a review of models and algorithms
Karimi, B., Ghomi, S. M. T. F., & Wilson, J. (2003) · Omega · doi:10.1016/s0305-0483(03)00059-8 · Cited by 873
Integrated Production and Outbound Distribution Scheduling: Review and Extensions
Chen, Z. (2009) · Operations Research · doi:10.1287/opre.1080.0688 · Cited by 600
Supply Chain Scheduling: Batching and Delivery
Hall, N. G., & Potts, C. N. (2003) · Operations Research · doi:10.1287/opre.51.4.566.16106 · Cited by 451
Self-citationMönch, L., Fowler, J. W., Dauzère-Pérès, S., Mason, S. J., & Rose, O. (2011) · Journal of Scheduling · doi:10.1007/s10951-010-0222-9 · Cited by 432
Metadata
- Authors
- Potts, C. N., & Kovalyov, M. Y.
- Affiliations
- University of Southampton (GB)
- National Academy of Sciences of Belarus (BY)
- Corresponding author
- Potts, Chris N.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2000-01
- Volume
- 120
- Issue
- 2
- Pages
- 228-249
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W1966523365
- Cited by
- 913
- References
- 72
- Citations by year
- 2026: 14 · 2025: 18 · 2024: 26 · 2023: 23 · 2022: 23 · 2021: 40 · 2020: 32 · 2019: 35 · 2018: 25 · 2017: 38 · 2016: 35 · 2015: 44 · 2014: 46 · 2013: 56 · 2012: 54
- FWCI
- 113.63
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- Locations
- European Journal of Operational Research (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- ePrints Soton (University of Southampton) (submittedVersion)
- Topics
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Scheduling and Optimization Algorithms
- Social Sciences › Decision Sciences › Management Science and Operations Research › Healthcare Operations and Scheduling Optimization
- Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Queuing Theory Analysis
- Keywords
- batch scheduling, dynamic programming algorithm, machine setup, scheduling algorithms
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: Scheduling with batching: A review. https://app.cochat.ai/papers/10.1016/s0377-2217(99)00153-8
- The paper
- Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: A review. European Journal of Operational Research. https://doi.org/10.1016/s0377-2217(99)00153-8
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.