Jan Karel Lenstra

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