World's Best Scientists 2026 revealed!
Award Badge
Mathematics
Netherlands
2026
Award Badge
Computer Science
Netherlands
2025

D-Index & Metrics

Computer Science

D-Index
60
Citations
43984
World Ranking
3150
National Ranking
31

Mathematics

D-Index
59
Citations
43831
World Ranking
567
National Ranking
2

Research.com Recognitions

  • 2026 - Research.com Mathematics in Netherlands Leader Award
  • 2025 - Research.com Computer Science in Netherlands Leader Award
  • 2025 - Research.com Mathematics in Netherlands Leader Award
  • 2022 - Research.com Computer Science in Netherlands Leader Award
  • 2013 - Fellow of the American Mathematical Society
  • 1997 - EURO Gold Medal

Overview

Jan Karel Lenstra is affiliated with the Centrum Wiskunde & Informatica in the Netherlands. Their research primarily spans the fields of Engineering and Computer Science, with notable contributions in subfields such as Industrial and Manufacturing Engineering, Computer Networks and Communications, Management Science and Operations Research, Computational Theory and Mathematics, and Electrical and Electronic Engineering.

The main topics of their work include Scheduling and Optimization Algorithms, Optimization and Packing Problems, Scheduling and Timetabling Solutions, Data Management and Algorithms, Optimization and Search Problems, semigroups and automata theory, and graph theory and CDMA systems.

Jan Karel Lenstra has published extensively in several venues. The most frequent publication outlets are:

  • Operations Research Letters
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • arXiv (Cornell University)
  • Journal of Scheduling

Recent papers authored or co-authored by Jan Karel Lenstra include:

  • "On the complexity of scheduling unrelated parallel machines with limited preemptions," 2023, published in Operations Research Letters
  • "3/2-Dual Approximation for CPU/GPU Scheduling," 2024, published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Elements of Scheduling," 2020, published in arXiv (Cornell University)
  • "A historical note on the complexity of scheduling problems," 2022, published in Operations Research Letters

Frequent co-authors collaborating with Jan Karel Lenstra include:

  • Luca Zaccarian
  • Andrew Teel Totally
  • Nonnegative Matrices
  • Shaun Fallat
  • Mehran Mesbahi

Their research topics express a strong focus on scheduling and optimization, addressing both theoretical and applied problems related to machine scheduling, CPU/GPU scheduling, and various optimization tasks in manufacturing and computational contexts.

Jan Karel Lenstra has received recognition in their field, including the EURO Gold Medal in 1997 and being named a Fellow of the American Mathematical Society in 2013.

Best Publications

  • Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

    R.L. Graham;E.L. Lawler;Jan Karel Lenstra;A.H.G. Rinnooy Kan

  • The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

    E.L. Lawler;Jan Karel Lenstra;A.H.G. Rinnooy Kan;D.B. Shmoys

  • Complexity of machine scheduling problems

    Jan Karel Lenstra;A.H.G. Rinnooy Kan;P. Brucker

  • Local Search in Combinatorial Optimization

    Emile Aarts;Jan K. Lenstra

  • The traveling salesman problem

    Eugene L. Lawler;Jan Karel Lenstra;Alexander H. G. Rinnooy Kan;David Shmoys

  • Sequencing and scheduling : algorithms and complexity

    EL Lawler;JK Jan Karel Lenstra;Ahg Alexander Rinnooy Kan;DB David Shmoys

  • Scheduling subject to resource constraints: classification and complexity

    Jacek Blazewicz;Jan Karel Lenstra;A. H. G. Rinnooy Kan

  • Job Shop Scheduling by Simulated Annealing

    Peter J. M. van Laarhoven;Emile H. L. Aarts;Jan Karel Lenstra

  • Complexity of vehicle routing and scheduling problems

    Jan Karel Lenstra;A. H. G. Rinnooy Kan

  • Approximation algorithms for scheduling unrelated parallel machines

    J. K. Lenstra;D. B. Shmoys;É. Tardos

  • Local Search in Combinatorial Optimisation.

    Unknown

  • Sequencing and scheduling : algorithms and complexity

    E.L. Lawler;J.K. Lenstra;A.H.G. Rinnooy Kan;D.B. Shmoys

  • Chapter 9 Sequencing and scheduling: Algorithms and complexity

    Eugene L. Lawler;Jan Karel Lenstra;Alexander H.G. Rinnooy Kan;David B. Shmoys

  • Complexity of Scheduling under Precedence Constraints

    J. K. Lenstra;A. H. G. Rinnooy Kan

  • Job Shop Scheduling by Local Search

    Rob J. M. Vaessens;Emile H. L. Aarts;Jan Karel Lenstra

  • The complexity of the network design problem

    David S. Johnson;Jan Karel Lenstra;A. H. G. Rinnooy Kan

  • Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms

    Eugene L. Lawler;Jan Karel Lenstra;A. H. G. Rinnooy Kan

  • Some Simple Applications of the Travelling Salesman Problem

    Jan Karel Lenstra;A.H.G. Rinnooy Kan

  • A Computational Study of Local Search Algorithms for Job Shop Scheduling

    E. H. L. Aarts;P. J. M. van Laarhoven;J. K. Lenstra;N. L. J. Ulder

  • Sequencing and scheduling

    Jan Karel Lenstra;A.H.G. Rinnooy Kan

  • Scheduling Theory and its Applications

    P. Chrétienne;E.G. Coffman;J.K. Lenstra;Zhen Liu

Frequent Co-Authors

David B. Shmoys
David B. Shmoys Cornell University
Eugene L. Lawler
Eugene L. Lawler University of California, Berkeley
A. H. G. Rinnooy Kan
A. H. G. Rinnooy Kan University of Amsterdam
Leen Stougie
Leen Stougie Centrum Wiskunde & Informatica
Emile H. L. Aarts
Emile H. L. Aarts Tilburg University
Martin W. P. Savelsbergh
Martin W. P. Savelsbergh Georgia Institute of Technology
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Marshall L. Fisher
Marshall L. Fisher University of Pennsylvania
François Soumis
François Soumis Polytechnique Montréal
Egon Balas
Egon Balas Carnegie Mellon University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics opens doors to various interdisciplinary fields and career opportunities. Many students consider complementing their math background with specialized degrees that enhance their analytical and strategic skills. For example, pursuing an ms in digital marketing degree cost usa can offer a competitive edge in data-driven marketing roles.

For those interested in leadership and business management, exploring options such as 12 month mba programs provides an accelerated path to gaining essential management skills. Additionally, flexibility is key for many learners, and finding an online mba accepting transfer credits can help save time and money by recognizing prior coursework.

Another growing field linked closely with mathematics is data science. Obtaining one of the best masters in data analytics programs prepares graduates for careers in analytics, predictive modeling, and big data—areas with strong job growth and high earning potential.

Choosing the right online degree that aligns with your mathematical expertise can enhance your career prospects and ensure a rewarding professional journey.

Best Scientists Citing Jan Karel Lenstra

Trending Scientists

Recently Published Articles