Lenstra J.K.

J.K. Lenstra

Information about the author J.K. Lenstra will soon be added to the site.
Found 10 papers in total
A local search template
1998
A template is presented that captures a vast majority of the local search algorithms...
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
1996
In 1954, Johnson gave an efficient algorithm for minimizing makespan in a two-machine...
A computational study of local search algorithms for job shop scheduling
1994
We present a computational performance analysis of local search algorithms for job...
Job shop scheduling by local search
1996
The authors survey solution methods for the job shop scheduling problem with an...
Three, four, five, six, or the complexity of scheduling with communication delays
1994
A set of unit-time tasks has to be processed on identical parallel processors subject...
Variable-depth search for the single-vehicle pickup and delivery problem with time windows
1993
The authors consider a single depot and a set of customers with known demands, each of...
A classification scheme for vehicle routing and scheduling problems
1990
A classification scheme is proposed for a class of models that arise in the area of...
Perspectives on parallel computing
1989
Operations research is one problem domain that is likely to benefit from advances in...
Parallel computing in combinatorial optimization
1988
This is a review of the literature on parallel computers and algorithms that is...
Behind the screen: DSS from an Operational Research OR point of view
1988
Interactive planning systems are a relatively new phenomenon in the practice of...
Papers per page: