Jan Karel Lenstra | Academic Influence

Jan Karel Lenstra's AcademicInfluence.com Rankings

Jan Karel Lenstra

Mathematics

#1238

World Rank

#2075

Historical Rank

Measure Theory

#586

World Rank

#816

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Jan Karel Lenstra's Degrees

PhD Mathematics University of Amsterdam
Masters Mathematics University of Amsterdam

Why Is Jan Karel Lenstra Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jan Karel Lenstra is a Dutch mathematician and operations researcher, known for his work on scheduling algorithms, local search, and the travelling salesman problem. Lenstra received his Ph.D. from the University of Amsterdam in 1976, advised by Gijsbert de Leve. He then became a researcher at the Centrum Wiskunde & Informatica, where he remained until 1989. After taking positions at the Eindhoven University of Technology and the Georgia Institute of Technology, he returned to CWI as its director in 2003. He stepped down in 2011, and at that time became a CWI Fellow. He was editor-in-chief of Mathematics of Operations Research from 1993 to 1998, and is editor-in-chief of Operations Research Letters since 2002.

(See a Problem?)

Jan Karel Lenstra's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey (1977) (5737)
Complexity of machine scheduling problems (1975) (2180)
Sequencing and scheduling: algorithms and complexity (1989) (1567)
Scheduling subject to resource constraints: classification and complexity (1983) (1359)
Local Search in Combinatorial Optimisation. (1997) (1320)
The traveling salesman problem (1985) (1311)
Complexity of vehicle routing and scheduling problems (1981) (1175)
Job Shop Scheduling by Simulated Annealing (1992) (1164)
Approximation algorithms for scheduling unrelated parallel machines (1987) (960)
Deterministic Production Planning: Algorithms and Complexity (1980) (639)
Complexity of Scheduling under Precedence Constraints (1978) (568)
Chapter 9 Sequencing and scheduling: Algorithms and complexity (1993) (476)
The complexity of the network design problem (1978) (404)
Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1986) (363)
Job Shop Scheduling by Local Search (1996) (330)
Recent developments in deterministic sequencing and scheduling: a survey : (preprint) (1981) (328)
Computational complexity of discrete optimization problems (1977) (299)
Sequencing and scheduling (1985) (292)
Scheduling Theory and its Applications (1997) (290)
Some Simple Applications of the Travelling Salesman Problem (1975) (288)
Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms (1980) (285)
On general routing problems (1976) (236)
A General Bounding Scheme for the Permutation Flow-Shop Problem (1978) (233)
Preemptive scheduling of uniform machines subject to release dates : (preprint) (1979) (228)
PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD (1996) (226)
Interval scheduling: A survey (2007) (225)
A Computational Study of Local Search Algorithms for Job Shop Scheduling (1994) (215)
Minimizing Total Costs in One-Machine Scheduling (1975) (214)
Short Shop Schedules (1997) (210)
Solving the Pell equation (2002) (206)
In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation (2016) (203)
Sequencing by enumerative methods (1977) (203)
A classification scheme for vehicle routing and scheduling problems (1990) (191)
Job-Shop Scheduling by Implicit Enumeration (1977) (190)
Multiprocessor scheduling with communication delays (1990) (185)
Automata, Languages and Programming (2003) (150)
The one-machine problem with delayed precedence constraints and its use in job shop scheduling (1995) (141)
A Guided Tour of Combinatorial Optimization (1985) (137)
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard (2004) (130)
Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints (1983) (127)
Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows (1993) (125)
Linear programming models with planned lead times for supply chain operations planning (2005) (119)
Minimizing maximum lateness on one machine : Computational experience and some applications (1976) (115)
Analytical Evaluation of Hierarchical Planning Systems (1981) (111)
Operations Research Letters (2011) (109)
History of mathematical programming : a collection of personal reminiscences (1991) (106)
A local search template (1998) (101)
Three, four, five, six, or the complexity of scheduling with communication delays (1994) (98)
Minimizing Maximum Lateness in a Two-Machine Open Shop (1979) (89)
Periodic Multiprocessor Scheduling (1991) (88)
Approximation algorithms for the test cover problem (2003) (88)
Technical Note - Clustering a Data Array and the Traveling-Salesman Problem (1974) (84)
Computer-Aided Complexity Classification of Dial-a-Ride Problems (2004) (74)
Sequencing and Scheduling: Algorithms and Complexity, in Logistics of production and inventory (1993) (65)
Computer aided complexity classification of deterministic scheduling problems (1981) (61)
Perspectives on parallel computing (1989) (60)
Complexity results for scheduling chains on a single machine : (preprint) (1980) (60)
Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems (1983) (59)
Surrogate duality relaxation for job shop scheduling (1983) (58)
Computer-Aided complexity classification of combinational problems (1982) (56)
The Complexity of Scheduling Trees with Communication Delays (1996) (54)
An overview of algorithmic approaches to frequency assignment problems (1995) (53)
Scheduling identical jobs on uniform parallel machines (1989) (51)
An introduction to parallelism in combinatorial optimization (1986) (50)
Towards a model and algorithm management system for vehicle routing and scheduling problems (1999) (47)
The complexity of the network design problem : (preprint) (1977) (45)
Local search algorithms for the radio link frequency assignment problem (2000) (39)
Complexity of vehicle routing and scheduling problems : (preprint) (1979) (39)
Resource-constrained project scheduling: an international exercise in DSS development (1988) (38)
One Machine Scheduling With Delayed Precedence Constraints. (1993) (37)
Scheduling Periodic Tasks (1996) (37)
Parallel computing in combinatorial optimization (1988) (36)
Combinatorial optimization : annotated bibliographies (1985) (35)
A framework for the probabilistic analysis of hierarchical planning systems (1984) (32)
Branch-and-Bound Algorithms for the Test Cover Problem (2002) (31)
The Parallel Complexity of TSP Heuristics (1989) (29)
New directions in scheduling theory (1984) (29)
On local search for the generalized graph coloring problem (2003) (29)
Computing near-optimal schedules (1995) (29)
Algorithms for Radio Link Frequency Assignment: The Calma Project (2002) (28)
Stochastic integer programming by dynamic programming (1985) (27)
Parallel machine scheduling: processing rates dependent on number of jobs in operation (1987) (26)
Machine scheduling with precedence con-straints (1982) (25)
BRANCHING FROM THE LARGEST UPPER BOUND: FOLKLORE AND FACTS (1978) (25)
Scheduling theory since 1981: an annotated bibliography (1983) (25)
Local search in combinatorial optimization (2nd revised edition) (2003) (23)
Periodic Assignment and Graph Colouring (1994) (22)
Combinatorics in operations research (1996) (22)
Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop (2005) (19)
Scheduling Periodic Tasks with Slack (1997) (17)
A decade of combinatorial optimization (1997) (16)
Sequencing and scheduling : an annotated bibliography (1997) (16)
Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines (1982) (16)
Two Lines Least Squares (1982) (15)
Technical Note - On the Expected Performance of Branch-and-Bound Algorithms (1978) (14)
Probabilistic analysis of combinatorial algorithms: an annotated bibliography (1984) (13)
A characterization of linear admissible transformations for the m-travelling salesmen problem: A result of Berenguer (1979) (12)
Algorithms for frequency assignment problems (1996) (11)
Deterministic and stochastic scheduling : proceedings of the NATO Advanced Study and Research Institute on Theoretical Approaches to Scheduling Problems, held in Durham, England, July 6-17, 1981 (1982) (10)
Job Shop Scheduling (1992) (10)
Deterministic and stochastic scheduling: : Extended abstracts (1981) (9)
Combinatorics in OR (1990) (9)
The mystical power of twoness : in memoriam Eugene L. Lawler (1998) (9)
Parallel computers and computations (1985) (9)
Computer aided complexity classification of combinatorial problems : (preprint) (1981) (8)
OR Forum - Perspectives on Parallel Computing (1989) (8)
Functional description of CAR : an interactive system for computer aided routing (1987) (7)
A variable depth approach for the single-vehicle pickup and delivery problem with time windows (1990) (7)
A recursive approach to the generation of combinatorial configurations (1975) (7)
A local search template (extended abstract) (1992) (7)
An introduction to multiprocessor scheduling (1980) (7)
Algorithms for the radio link frequency assignment problem (1999) (7)
Machine scheduling with precedence constraints : (preprint) (1981) (6)
Two Open Problems in Precedence Constrained Scheduling (1982) (6)
Interfaces between Computer Sciences and Operations Research. (1979) (6)
Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations (1973) (5)
Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem (1993) (4)
Parallel algorithms in combinatorial optimization: an annotated bibliography (1983) (4)
Elements of Scheduling (2020) (4)
Mathematics and computer science II : fundamental contributions in the Netherlands since 1945 : [symposium held in Amsterdam, 06-07.10.1986] (1986) (4)
An appraisal of computational complexity for operations researchers : Preprint (1982) (4)
Interfaces between operations research and computer science (1986) (3)
The Complexity of Scheduling Trees with Communication Delays (Extended Abstract) (1993) (3)
Introduction - Special Focus and Decision Support Systems (DSS) (1988) (3)
Machine scheduling problems; computations, complexity and classification : In honour of A.G.H. Rinnooy Kan upon the occasion of the defense of his doctoral thesis, 28.01.1976 (1976) (3)
Surrogate duality relaxation for job shop scheduling : (preprint) (1981) (3)
Deterministic production planning: algorithms and complexity : (preprint) (1978) (2)
Interfaces between computer science and operations research : proceedings of a symposium held at the Mathematisch Centrum, Amsterdam, 07-10.09.1976 (1978) (2)
Proceedings of the 30th international conference on Automata, languages and programming (2003) (2)
Local improvement algorithms for a path packing problem: A performance analysis based on linear programming (2021) (2)
A hierarchical clustering scheme for asymmetric matrices : (preprint) (1978) (2)
A comparative study in DSS development (1994) (2)
Twenty-five years of operations research in the Netherlands : papers dedicated to Gijs de Leve (1989) (2)
The Mathematical Programming Society (1977) (2)
At play in the fields of scheduling theory (1982) (2)
Linear programming models for production planning (1999) (1)
Report of the Session on Algorithms for Special Classes of Combinatorial Optimization Problems (1979) (1)
Whizzkids: two exercises in computational discrete optimization (2000) (1)
Fifth EURO summer institute (1990) (1)
Mathematics and computer science : proceedings of the CWI symposium, Amsterdam, November 1983 (1986) (1)
A recursive approach to the implementation of enumerative methods : (preprint) (1980) (1)
Computational complexity of discrete optimization problems : (preprint) (1977) (1)
Book review: The Travelling Salesman Problem: A Computational Study (2009) (1)
Constrained scheduling of VLSI algorithms (1990) (1)
Preface (Special issue in memory of Eugene L. Lawler (1933-1994)) (1998) (1)
Functionele beschrijving van CAR, een interactief systeem voor 'computer aided routing' [Functional description of CAR, an interactive system for 'computer aided design'] (1987) (1)
In Memoriam Gijs de Leve (1926–2009) (2010) (0)
The Mathematical Programming Society (1972) (0)
Combinatorische Optimalisering - BETA (1995) (0)
Editorial introduction (Special issue on Operations Research in Logistics) (1990) (0)
Combinatorial Optimization - BETA (1995) (0)
Minmax criteria, no preemption (2019) (0)
Preface (2007) (0)
Thirty years KNMB (2018) (0)
Book review: The traveling salesman problem: a computational study (by D.L. Applegate, R.E. Bixby, V. Chvátal, W.J. Cook) (2009) (0)
Crisis? Investeer in inventie (2011) (0)
Twintig jaar internet : YouTube film (2008) (0)
Amy Ward new Editor-in-Chief (2021) (0)
An introduction to multiprocessor scheduling : (preprint) (1980) (0)
Book review (1994) (0)
Selected publications of Eugene L. Lawler (1999) (0)
Preface to the paperback edition (2003) (0)
The Parallel Complexity of TSP Heuristics GAP (2007) (0)
Mathematics and computer science : proceedings of the CWI symposium, November 1983 (1986) (0)
Dutch-French research team searches for errors in software - interview met P. Klint en J.K. Lenstra (2010) (0)
Book reviews (1985) (0)
A historical note on the complexity of scheduling problems (2022) (0)
The bus driver scheduling problem of the Amsterdam Transit Company (1993) (0)
Appendix a Proof of Theorem 3.1: We Represent the System by a Bipartite Graph Claim 4.2 Every D Gj 2 G Lled during the Rst Stage of a R Unites the Holes Existing in R into A (2011) (0)
Parallel machines - Minmax criteria, no preemption (2019) (0)
Towards a better algorithm for the job-shop scheduling problem, 1 (1973) (0)
Presentation Evaluation Committee "A birds-eye view of CWI" (2011) (0)
Mathematics of operations research (1998) (0)
Introduction a l' ordonnancement de plusieurs machines : (prepublication) (1980) (0)
Preface (Special issue on ICALP 2003) (2007) (0)
A scientist on publishers (1991) (0)
The Mathematical Programming Society (1978) (0)
The Travelling Salesman Problem (Dagstuhl Seminar 02261) (2021) (0)
Two lines least squares : (preprint) (1981) (0)
Deterministic Machine Scheduling Problems (2019) (0)
Preliminaries - Deterministic Machine Scheduling Problems (2019) (0)
Bounds for multiprocessor flow shops (1994) (0)
Analytical evaluation of hierarchical planning systems : (preprint) (1980) (0)
Thirty years LNMB (2018) (0)
So We Have Cc (i) + a = Cnn + C 5 Computational Results (2008) (0)
The Mathematical Programming Society (1976) (0)
Guest Editors' Introduction (1992) (0)
Algorithmics and heuristics in combinatorial optimization (1988) (0)
Problemen oplossen in de Lage Landen (1996) (0)
Job shop scheduling (Extended abstract) (1992) (0)
The day before tomorrow : report on a three week visit to China (1984) (0)
Euclid Calma Radio Link Frequency Assignment Project Technical Annex T-2.2.1.b: Combinatorial Lower Bounds for the Rlfap (2007) (0)
In memoriam Gerhard Woeginger (2022) (0)
Book reviews (1991) (0)
A note on the expected performance of branch-and-bound algorithms : (prepublication) (1976) (0)
Tank Container Depots in a Developing Tank Container Industry: Scenarios for the need of tank container depots in China´s Yangtze River Delta (2010) (0)
On the complexity of scheduling unrelated parallel machines with limited preemptions (2023) (0)
Minmax criteria (2019) (0)
Flow Shops (2019) (0)
Model checking and testing combined (2003) (0)
Selected papers of Eugene L. Lawler (1999) (0)
Computer-Aided ComplexityClassi ation of Diala-Ride ProblemsW (2002) (0)
Parallel computers and computations : [a series of eight lectures organized at the University of Utrecht, fall 1983] (1985) (0)
The single machine - Minmax criteria (2019) (0)
In Memoriam: Eugene L. Lawler (1994) (0)
Multi-operation models - Flow shops (2019) (0)

This paper list is powered by the following services:

Other Resources About Jan Karel Lenstra

en.wikipedia.org

What Schools Are Affiliated With Jan Karel Lenstra?

Jan Karel Lenstra is affiliated with the following schools:

Image Attributions

Image Source for Jan Karel Lenstra