Jan Karel Lenstra

Publication Activity (10 Years)

Years Active: 1974-2023
Publications (10 Years): 7

Top Topics

Resource Allocation

Packing Problem

Linear Programming

Parallel Processors

Top Venues

Oper. Res. Lett.

Publications

Jan Karel Lenstra, Nodari Vakhania
On the complexity of scheduling unrelated parallel machines with limited preemptions. Oper. Res. Lett. 51 (2) (2023)
Jan Karel Lenstra, Vitaly A. Strusevich, Milan Vlach
A historical note on the complexity of scheduling problems. Oper. Res. Lett. 51 (1) (2023)
Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz
In memoriam Gerhard Woeginger. J. Sched. 25 (5) (2022)
Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz
In memoriam Gerhard Woeginger. Oper. Res. Lett. 50 (3) (2022)
Jan Karel Lenstra
Amy Ward new Editor-in-Chief. Oper. Res. Lett. 49 (2) (2021)
Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie
Local improvement algorithms for a path packing problem: A performance analysis based on linear programming. Oper. Res. Lett. 49 (1) (2021)
Jan Karel Lenstra, David B. Shmoys
Elements of Scheduling. CoRR (2020)
Jan Karel Lenstra
Editorial. Oper. Res. Lett. 40 (1) (2012)
Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger
Preface. Theor. Comput. Sci. 379 (3) (2007)
J. M. Spitter, Cor A. J. Hurkens, Ton G. de Kok, Jan Karel Lenstra, Ebbe G. Negenman
Linear programming models with planned lead times for supply chain operations planning. Eur. J. Oper. Res. 163 (3) (2005)
Ann Vandevelde, Han Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra
Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop. INFORMS J. Comput. 17 (3) (2005)
Wenci Yu, Han Hoogeveen, Jan Karel Lenstra
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard. J. Sched. 7 (5) (2004)
Willem de Paepe, Jan Karel Lenstra, Jirí Sgall, René A. Sitters, Leen Stougie
Computer-Aided Complexity Classification of Dial-a-Ride Problems. INFORMS J. Comput. 16 (2) (2004)
Tjark Vredeveld, Jan Karel Lenstra
On local search for the generalized graph coloring problem. Oper. Res. Lett. 31 (1) (2003)
Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie
Approximation algorithms for the test cover problem. Math. Program. 98 (1-3) (2003)
Karen Aardal, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey R. Tiourine
Algorithms for Radio Link Frequency Assignment: The Calma Project. Oper. Res. 50 (6) (2002)
Koen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie
Branch-and-Bound Algorithms for the Test Cover Problem. ESA (2002)
Sergey R. Tiourine, Cor A. J. Hurkens, Jan Karel Lenstra
Local search algorithms for the radio link frequency assignment problem. Telecommun. Syst. 13 (2-4) (2000)
M. Desrochers, C. V. Jones, Jan Karel Lenstra, Martin W. P. Savelsbergh, Leen Stougie
Towards a model and algorithm management system for vehicle routing and scheduling problems. Decis. Support Syst. 25 (2) (1999)
Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra
A local search template. Comput. Oper. Res. 25 (11) (1998)
David P. Williamson, Leslie A. Hall, J. A. Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey Vasil'evich Sevast'janov, David B. Shmoys
Short Shop Schedules. Oper. Res. 45 (2) (1997)
Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra
Scheduling Periodic Tasks with Slack. INFORMS J. Comput. 9 (4) (1997)
Jan Karel Lenstra, Marinus Veldhorst, Bart Veltman
The Complexity of Scheduling Trees with Communication Delays. J. Algorithms 20 (1) (1996)
Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra
Job Shop Scheduling by Local Search. INFORMS J. Comput. 8 (3) (1996)
Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra
Scheduling Periodic Tasks. INFORMS J. Comput. 8 (4) (1996)
Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels
Periodic Assignment and Graph Colouring. Discret. Appl. Math. 51 (3) (1994)
Emile H. L. Aarts, Peter J. M. van Laarhoven, Jan Karel Lenstra, Nico L. J. Ulder
A Computational Study of Local Search Algorithms for Job Shop Scheduling. INFORMS J. Comput. 6 (2) (1994)
J. A. Hoogeveen, Jan Karel Lenstra, Bart Veltman
Three, four, five, six, or the complexity of scheduling with communication delays. Oper. Res. Lett. 16 (3) (1994)
Jan Karel Lenstra, Marinus Veldhorst
The Complexity of Scheduling Trees with Communication Delays (Extended Abstract). ESA (1993)
Gerard A. P. Kindervater, Jan Karel Lenstra, Martin W. P. Savelsbergh
Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem. Discret. Appl. Math. 42 (2) (1993)
L. J. J. van der Bruggen, Jan Karel Lenstra, P. C. Schuur
Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows. Transp. Sci. 27 (3) (1993)
Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra
A Local Search Template. PPSN (1992)
Peter J. M. van Laarhoven, Emile H. L. Aarts, Jan Karel Lenstra
Job Shop Scheduling by Simulated Annealing. Oper. Res. 40 (1) (1992)
Joseph S. B. Mitchell, Jan Karel Lenstra
Guest Editors' Introduction. INFORMS J. Comput. 4 (4) (1992)
Jan Karel Lenstra, F. Gianessi, Richard W. Cottle
Book reviews. ZOR Methods Model. Oper. Res. 35 (2) (1991)
Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels
Periodic Multiprocessor Scheduling. PARLE (1) (1991)
Bart Veltman, B. J. Lageweg, Jan Karel Lenstra
Multiprocessor scheduling with communication delays. Parallel Comput. 16 (2-3) (1990)
Jan Karel Lenstra, David B. Shmoys, Éva Tardos
Approximation Algorithms for Scheduling Unrelated Parallel Machines. Math. Program. 46 (1990)
Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys
The Parallel Complexity of TSP Heuristics. J. Algorithms 10 (2) (1989)
Gerard A. P. Kindervater, Jan Karel Lenstra, A. H. G. Rinnooy Kan
OR Forum - Perspectives on Parallel Computing. Oper. Res. 37 (6) (1989)
Paul Gray, Jan Karel Lenstra
Introduction - Special Focus and Decision Support Systems (DSS). Oper. Res. 36 (6) (1988)
Jac M. Anthonisse, Jan Karel Lenstra, Martin W. P. Savelsbergh
Behind the screen: DSS from an OR point of view. Decis. Support Syst. 4 (4) (1988)
Jac M. Anthonisse, Kees M. van Hee, Jan Karel Lenstra
Resource-constrained project scheduling: an international exercise in DSS development. Decis. Support Syst. 4 (2) (1988)
Jan Karel Lenstra, David B. Shmoys, Éva Tardos
Approximation Algorithms for Scheduling Unrelated Parallel Machines FOCS (1987)
Gerard A. P. Kindervater, Jan Karel Lenstra
An introduction to parallelism in combinatorial optimization. Discret. Appl. Math. 14 (2) (1986)
Jan Karel Lenstra, A. H. G. Rinnooy Kan, Leen Stougie
A framework for the probabilistic analysis of hierarchical planning systems. Ann. Oper. Res. 1 (1) (1984)
K. R. Baker, Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints. Oper. Res. 31 (2) (1983)
M. A. H. Dempster, M. L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems. Math. Oper. Res. 8 (4) (1983)
Jacek Blazewicz, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Scheduling subject to resource constraints: classification and complexity. Discret. Appl. Math. 5 (1) (1983)
M. L. Fisher, B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan
Surrogate duality relaxation for job shop scheduling. Discret. Appl. Math. 5 (1) (1983)
Katsuto Nakajima, S. Louis Hakimi, Jan Karel Lenstra
Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines. SIAM J. Comput. 11 (3) (1982)
B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Computer-Aided Complexity Classification of Combinatorial Problems. Commun. ACM 25 (11) (1982)
Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Erratum. Math. Oper. Res. 7 (4) (1982)
Jan Karel Lenstra, A. H. G. Rinnooy Kan
Complexity of vehicle routing and scheduling problems. Networks 11 (2) (1981)
Michael A. H. Dempster, M. L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Analytical Evaluation of Hierarchical Planning Systems. Oper. Res. 29 (4) (1981)
Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Minimizing Maximum Lateness in a Two-Machine Open Shop. Math. Oper. Res. 6 (1) (1981)
Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms. SIAM J. Comput. 9 (3) (1980)
Jan Karel Lenstra, A. H. G. Rinnooy Kan
Technical Note - On the Expected Performance of Branch-and-Bound Algorithms. Oper. Res. 26 (2) (1978)
B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
A General Bounding Scheme for the Permutation Flow-Shop Problem. Oper. Res. 26 (1) (1978)
Jan Karel Lenstra, A. H. G. Rinnooy Kan
Complexity of Scheduling under Precedence Constraints. Oper. Res. 26 (1) (1978)
David S. Johnson, Jan Karel Lenstra, A. H. G. Rinnooy Kan
The complexity of the network design problem. Networks 8 (4) (1978)
Jan Karel Lenstra, A. H. G. Rinnooy Kan
On general routing problems. Networks 6 (3) (1976)
A. H. G. Rinnooy Kan, B. J. Lageweg, Jan Karel Lenstra
Minimizing Total Costs in One-Machine Scheduling. Oper. Res. 23 (5) (1975)
Jan Karel Lenstra
Technical Note - Clustering a Data Array and the Traveling-Salesman Problem. Oper. Res. 22 (2) (1974)