Jan Karel Lenstra

According to our database, Jan Karel Lenstra authored at least 62 papers between 1974 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

On the complexity of scheduling unrelated parallel machines with limited preemptions.

Jan Karel Lenstra, Nodari Vakhania

Oper. Res. Lett., March, 2023

A historical note on the complexity of scheduling problems.

Jan Karel Lenstra, Vitaly A. Strusevich, Milan Vlach

Oper. Res. Lett., January, 2023

2022

In memoriam Gerhard Woeginger.

Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz

Oper. Res. Lett., 2022

2021

Amy Ward new Editor-in-Chief.

Jan Karel Lenstra

Oper. Res. Lett., 2021

Local improvement algorithms for a path packing problem: A performance analysis based on linear programming.

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

Oper. Res. Lett., 2021

2020

Elements of Scheduling.

Jan Karel Lenstra, David B. Shmoys

CoRR, 2020

2012

Editorial.

Jan Karel Lenstra

Oper. Res. Lett., 2012

2007

Preface.

Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger

Theor. Comput. Sci., 2007

2005

Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop.

Ann Vandevelde, Han Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra

INFORMS J. Comput., 2005

Linear programming models with planned lead times for supply chain operations planning.

J. M. Spitter, Cor A. J. Hurkens, Ton G. de Kok, Jan Karel Lenstra, Ebbe G. Negenman

Eur. J. Oper. Res., 2005

2004

Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard.

Wenci Yu, Han Hoogeveen, Jan Karel Lenstra

J. Sched., 2004

Computer-Aided Complexity Classification of Dial-a-Ride Problems.

Willem de Paepe, Jan Karel Lenstra, Jirí Sgall, René A. Sitters, Leen Stougie

INFORMS J. Comput., 2004

2003

On local search for the generalized graph coloring problem.

Tjark Vredeveld, Jan Karel Lenstra

Oper. Res. Lett., 2003

Approximation algorithms for the test cover problem.

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

Math. Program., 2003

2002

Algorithms for Radio Link Frequency Assignment: The Calma Project.

Karen I. Aardal, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey R. Tiourine

Oper. Res., 2002

Branch-and-Bound Algorithms for the Test Cover Problem.

Koen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie

Proceedings of the Algorithms, 2002

2000

Local search algorithms for the radio link frequency assignment problem.

Sergey R. Tiourine, Cor A. J. Hurkens, Jan Karel Lenstra

Telecommun. Syst., 2000

1999

Towards a model and algorithm management system for vehicle routing and scheduling problems.

Martin Desrochers, Christopher V. Jones, Jan Karel Lenstra, Martin W. P. Savelsbergh, Leen Stougie

Decis. Support Syst., 1999

1998

A local search template.

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

Comput. Oper. Res., 1998

1997

Short Shop Schedules.

David P. Williamson, Leslie A. Hall, J. A. Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey Vasil'evich Sevast'janov, David B. Shmoys

Oper. Res., 1997

Scheduling Periodic Tasks with Slack.

Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra

INFORMS J. Comput., 1997

1996

The Complexity of Scheduling Trees with Communication Delays.

Jan Karel Lenstra, Marinus Veldhorst, Bart Veltman

J. Algorithms, 1996

Job Shop Scheduling by Local Search.

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

INFORMS J. Comput., 1996

Scheduling Periodic Tasks.

Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra

INFORMS J. Comput., 1996

1994

Three, four, five, six, or the complexity of scheduling with communication delays.

J. A. Hoogeveen, Jan Karel Lenstra, Bart Veltman

Oper. Res. Lett., 1994

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

Emile H. L. Aarts, Peter J. M. van Laarhoven, Jan Karel Lenstra, Nico L. J. Ulder

INFORMS J. Comput., 1994

Periodic Assignment and Graph Colouring.

Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels

Discret. Appl. Math., 1994

1993

Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows.

L. J. J. van der Bruggen, Jan Karel Lenstra, P. C. Schuur

Transp. Sci., 1993

Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem.

Gerard A. P. Kindervater, Jan Karel Lenstra, Martin W. P. Savelsbergh

Discret. Appl. Math., 1993

The Complexity of Scheduling Trees with Communication Delays (Extended Abstract).

Jan Karel Lenstra, Marinus Veldhorst

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

Chapter 9 Sequencing and scheduling: Algorithms and complexity.

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

Proceedings of the Logistics of Production and Inventory, 1993

1992

Job Shop Scheduling by Simulated Annealing.

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

Oper. Res., 1992

Guest Editors' Introduction.

Joseph S. B. Mitchell, Jan Karel Lenstra

INFORMS J. Comput., 1992

1991

Book reviews.

Jan Karel Lenstra, F. Gianessi, Richard W. Cottle

ZOR Methods Model. Oper. Res., 1991

Periodic Multiprocessor Scheduling.

Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels

Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

1990

Multiprocessor scheduling with communication delays.

Bart Veltman, B. J. Lageweg, Jan Karel Lenstra

Parallel Comput., 1990

Approximation Algorithms for Scheduling Unrelated Parallel Machines.

Jan Karel Lenstra, David B. Shmoys, Éva Tardos

Math. Program., 1990

1989

The Parallel Complexity of TSP Heuristics.

Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys

J. Algorithms, 1989

OR Forum - Perspectives on Parallel Computing.

Gerard A. P. Kindervater, Jan Karel Lenstra, A. H. G. Rinnooy Kan

Oper. Res., 1989

1988

Introduction - Special Focus and Decision Support Systems (DSS).

Paul Gray, Jan Karel Lenstra

Oper. Res., 1988

Behind the screen: DSS from an OR point of view.

Jac M. Anthonisse, Jan Karel Lenstra, Martin W. P. Savelsbergh

Decis. Support Syst., 1988

Resource-constrained project scheduling: an international exercise in DSS development.

Jac M. Anthonisse, Kees M. van Hee, Jan Karel Lenstra

Decis. Support Syst., 1988

1986

An introduction to parallelism in combinatorial optimization.

Gerard A. P. Kindervater, Jan Karel Lenstra

Discret. Appl. Math., 1986

1984

A framework for the probabilistic analysis of hierarchical planning systems.

Jan Karel Lenstra, A. H. G. Rinnooy Kan, Leen Stougie

Ann. Oper. Res., 1984

1983

Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems.

M. A. H. Dempster, Marshall L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan

Math. Oper. Res., 1983

Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints.

K. R. Baker, Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan

Oper. Res., 1983

Surrogate duality relaxation for job shop scheduling.

Marshall L. Fisher, B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan

Discret. Appl. Math., 1983

Scheduling subject to resource constraints: classification and complexity.

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

Discret. Appl. Math., 1983

1982

Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines.

Katsuto Nakajima, S. Louis Hakimi, Jan Karel Lenstra

SIAM J. Comput., 1982

Erratum.

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

Math. Oper. Res., 1982

Computer-Aided Complexity Classification of Combinatorial Problems.

B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan

Commun. ACM, 1982

1981

Complexity of vehicle routing and scheduling problems.

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

Networks, 1981

Minimizing Maximum Lateness in a Two-Machine Open Shop.

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

Math. Oper. Res., 1981

Analytical Evaluation of Hierarchical Planning Systems.

Michael A. H. Dempster, Marshall L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan

Oper. Res., 1981

1980

Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms.

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

SIAM J. Comput., 1980

1978

The complexity of the network design problem.

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

Networks, 1978

Technical Note - On the Expected Performance of Branch-and-Bound Algorithms.

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

Oper. Res., 1978

Complexity of Scheduling under Precedence Constraints.

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

Oper. Res., 1978

A General Bounding Scheme for the Permutation Flow-Shop Problem.

B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan

Oper. Res., 1978

1976

On general routing problems.

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

Networks, 1976

1975

Minimizing Total Costs in One-Machine Scheduling.

A. H. G. Rinnooy Kan, B. J. Lageweg, Jan Karel Lenstra

Oper. Res., 1975

1974

Technical Note - Clustering a Data Array and the Traveling-Salesman Problem.

Jan Karel Lenstra

Oper. Res., 1974