Jan Karel Lenstra

According to our database1, Jan Karel Lenstra authored at least 56 papers between 1974 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2012
Editorial.
Oper. Res. Lett., 2012

2007
Preface.
Theor. Comput. Sci., 2007

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

Linear programming models with planned lead times for supply chain operations planning.
European Journal of Operational Research, 2005

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

Computer-Aided Complexity Classification of Dial-a-Ride Problems.
INFORMS Journal on Computing, 2004

2003
On local search for the generalized graph coloring problem.
Oper. Res. Lett., 2003

Approximation algorithms for the test cover problem.
Math. Program., 2003

2002
Algorithms for Radio Link Frequency Assignment: The Calma Project.
Operations Research, 2002

Branch-and-Bound Algorithms for the Test Cover Problem.
Proceedings of the Algorithms, 2002

2000
Local search algorithms for the radio link frequency assignment problem.
Telecommunication Systems, 2000

1999
Towards a model and algorithm management system for vehicle routing and scheduling problems.
Decision Support Systems, 1999

1997
Short Shop Schedules.
Operations Research, 1997

Scheduling Periodic Tasks with Slack.
INFORMS Journal on Computing, 1997

1996
The Complexity of Scheduling Trees with Communication Delays.
J. Algorithms, 1996

Job Shop Scheduling by Local Search.
INFORMS Journal on Computing, 1996

Scheduling Periodic Tasks.
INFORMS Journal on Computing, 1996

1994
Three, four, five, six, or the complexity of scheduling with communication delays.
Oper. Res. Lett., 1994

A Computational Study of Local Search Algorithms for Job Shop Scheduling.
INFORMS Journal on Computing, 1994

Periodic Assignment and Graph Colouring.
Discrete Applied Mathematics, 1994

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

Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem.
Discrete Applied Mathematics, 1993

The Complexity of Scheduling Trees with Communication Delays (Extended Abstract).
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
Job Shop Scheduling by Simulated Annealing.
Operations Research, 1992

Guest Editors' Introduction.
INFORMS Journal on Computing, 1992

A Local Search Template.
Proceedings of the Parallel Problem Solving from Nature 2, 1992

1991
Book reviews.
ZOR - Meth. & Mod. of OR, 1991

Periodic Multiprocessor Scheduling.
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

1990
Multiprocessor scheduling with communication delays.
Parallel Computing, 1990

Approximation Algorithms for Scheduling Unrelated Parallel Machines.
Math. Program., 1990

1989
The Parallel Complexity of TSP Heuristics.
J. Algorithms, 1989

OR Forum - Perspectives on Parallel Computing.
Operations Research, 1989

1988
Introduction - Special Focus and Decision Support Systems (DSS).
Operations Research, 1988

Behind the screen: DSS from an OR point of view.
Decision Support Systems, 1988

Resource-constrained project scheduling: an international exercise in DSS development.
Decision Support Systems, 1988

1987
Approximation Algorithms for Scheduling Unrelated Parallel Machines
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
An introduction to parallelism in combinatorial optimization.
Discrete Applied Mathematics, 1986

1984
A framework for the probabilistic analysis of hierarchical planning systems.
Annals OR, 1984

1983
Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems.
Math. Oper. Res., 1983

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

Surrogate duality relaxation for job shop scheduling.
Discrete Applied Mathematics, 1983

Scheduling subject to resource constraints: classification and complexity.
Discrete Applied Mathematics, 1983

1982
Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines.
SIAM J. Comput., 1982

Erratum.
Math. Oper. Res., 1982

Computer-Aided Complexity Classification of Combinatorial Problems.
Commun. ACM, 1982

1981
Complexity of vehicle routing and scheduling problems.
Networks, 1981

Minimizing Maximum Lateness in a Two-Machine Open Shop.
Math. Oper. Res., 1981

Analytical Evaluation of Hierarchical Planning Systems.
Operations Research, 1981

1980
Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms.
SIAM J. Comput., 1980

1978
The complexity of the network design problem.
Networks, 1978

Technical Note - On the Expected Performance of Branch-and-Bound Algorithms.
Operations Research, 1978

Complexity of Scheduling under Precedence Constraints.
Operations Research, 1978

A General Bounding Scheme for the Permutation Flow-Shop Problem.
Operations Research, 1978

1976
On general routing problems.
Networks, 1976

1975
Minimizing Total Costs in One-Machine Scheduling.
Operations Research, 1975

1974
Technical Note - Clustering a Data Array and the Traveling-Salesman Problem.
Operations Research, 1974


  Loading...