The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches
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
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
(2003) · International Series in Operations Research & Management Science · doi:10.1007/b101874 · Cited by 3,430
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Inventory management and production planning and scheduling
(1999) · Journal of Manufacturing Systems · doi:10.1016/s0278-6125(99)90116-4 · Cited by 2,787
Decomposition Principle for Linear Programs
Dantzig, G. B., & Wolfe, P. (1960) · Operations Research · doi:10.1287/opre.8.1.101 · Cited by 2,315
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
How to Solve It: Modern Heuristics
Michalewicz, Z., & Fogel, D. B. (2000) · Springer eBooks · doi:10.1007/978-3-662-04131-4 · Cited by 2,207
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Fisher, M. L. (1981) · Management Science · doi:10.1287/mnsc.27.1.1 · Cited by 2,109
Dynamic Version of the Economic Lot Size Model
Wagner, H. M., & Whitin, T. M. (1958) · Management Science · doi:10.1287/mnsc.5.1.89 · Cited by 2,061
Dynamic Version of the Economic Lot Size Model
Wagner, H. M., & Whitin, T. M. (2004) · Management Science · doi:10.1287/mnsc.1040.0262 · Cited by 2,056
Optimal Policies for a Multi-Echelon Inventory Problem
Clark, A. J., & Scarf, H. (2004) · Management Science · doi:10.1287/mnsc.1040.0265 · Cited by 1,256
Optimal Policies for a Multi-Echelon Inventory Problem
Clark, A. J., & Scarf, H. (1960) · Management Science · doi:10.1287/mnsc.6.4.475 · Cited by 1,252
Lagrangean relaxation for integer programming
Geoffrion, A. M. (1974) · Mathematical Programming Studies · doi:10.1007/bfb0120690 · Cited by 1,111
Lagrangian Relaxation for Integer Programming
Geoffrion, A. M. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_9 · Cited by 974
Deterministic Production Planning: Algorithms and Complexity
Florian, M., Lenstra, J. K., & Kan, A. H. G. R. (1980) · Management Science · doi:10.1287/mnsc.26.7.669 · Cited by 627
Computational Complexity of the Capacitated Lot Size Problem
Bitran, G. R., & Yanasse, H. H. (1982) · Management Science · doi:10.1287/mnsc.28.10.1174 · Cited by 542
Logistics of Production and Inventory
Rand, G. K. (1995) · Journal of the Operational Research Society · doi:10.1057/jors.1995.17 · Cited by 397
Improved Algorithms for Economic Lot Size Problems
Aggarwal, A., & Park, J. K. (1993) · Operations Research · doi:10.1287/opre.41.3.549 · Cited by 362
Erratum: Deterministic Production Planning with Concave Costs and Capacity Constraints
Florian, M., & Klein, M. (1972) · Management Science · doi:10.1287/mnsc.18.11.721 · Cited by 342
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial
Rardin, R. L., & Uzsoy, R. (2001) · Journal of Heuristics · doi:10.1023/a:1011319115230 · Cited by 332
Deterministic Production Planning with Concave Costs and Capacity Constraints
Florian, M., & Klein, M. (1971) · Management Science · doi:10.1287/mnsc.18.1.12 · Cited by 310
État de l'art des méthodes “d'optimisation globale”
Berthiau, G., & Siarry, P. (2001) · RAIRO - Operations Research · doi:10.1051/ro:2001118 · Cited by 210
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions
Jünger, M., & Naddef, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45586-8 · Cited by 157
An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
van Hoesel, S. P. M., & Wagelmans, A. P. M. (1996) · Management Science · doi:10.1287/mnsc.42.1.142 · Cited by 155
Cattrysse, D., Salomon, M., Kuik, R., & Wassenhove, L. N. V. (1993) · Management Science · doi:10.1287/mnsc.39.4.477 · Cited by 104
A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
Gopalakrishnan, M., Ding, K., Bourjolly, J.-M., & Mohan, S. (2001) · Management Science · doi:10.1287/mnsc.47.6.851.9813 · Cited by 103
Kuik, R., SALOMON, M., Wassenhove, L. N. V., & MAES, J. (1993) · IIE Transactions · doi:10.1080/07408179308964266 · Cited by 90
Simulated annealing in lot sizing problems
Tang, O. (2003) · International Journal of Production Economics · doi:10.1016/j.ijpe.2003.11.006 · Cited by 79
Lot-Sizing with Start-Up Times
Vanderbeck, F. (1998) · Management Science · doi:10.1287/mnsc.44.10.1409 · Cited by 59
Lot sizing for a product subject to obsolescence or perishability
Jain, K., & Silver, E. A. (1994) · European Journal of Operational Research · doi:10.1016/0377-2217(94)90075-2 · Cited by 57
A neural network model for solving the lot-sizing problem
Gaafar, L. K., & Choueiki, M. H. (2000) · Omega · doi:10.1016/s0305-0483(99)00035-3 · Cited by 49
Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”
Bruggemann, W., & Jahnke, H. (1997) · Management Science · doi:10.1287/mnsc.43.1.122 · Cited by 46
A capacity constrained single-facility dynamic lot-size model
Lambrecht, M., & Eecken, J. V. (1978) · European Journal of Operational Research · doi:10.1016/0377-2217(78)90109-1 · Cited by 45
Metadata
- Authors
- Jans, R., & Degraeve, Z.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2007-03
- Volume
- 177
- Issue
- 3
- Pages
- 1855-1875
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W1978009882
- Cited by
- 297
- References
- 35
- FWCI
- 50.23
- Type
- journal article
- Language
- en
- Open access
- closed
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.