Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Jan Karel Lenstra
Information about the author Jan Karel Lenstra will soon be added to the site.
Found
19 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Interval scheduling: a survey
2007
In interval scheduling, not only the processing times of the jobs but also their...
Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
2004
One of the first problems to be studied in scheduling theory was the problem of...
Computer-aided complexity classification of dial-a-ride problem
2004
In dial-a-ride problems, items have to be transported from a source to a destination....
Lower bounds for the head–body–tail problem on parallel machines: A computational study of the multiprocessor flow shop
2005
The multiprocessor flow-shop is the generalization of the flow-shop in which each...
Linear programming models with planned lead times for supply chain operations planning
2005
This paper contributes to the development of models for capacity constrained Supply...
On local search for the generalized graph coloring problem
2003
Given an edge-weighted graph and an integer k , the generalized graph coloring problem...
Algorithms for radio link frequency assignment: The CALMA project
2002
The radio link frequency assignment problem occurs when a network of radio links has...
The mystical power of twoness: In memoriam Eugene L. Lawler
1998
This paper reviews the work of Eugene L. Lawler, one of the early investigators of...
Scheduling periodic tasks with slack
1997
We consider the problem of nonpreemptively scheduling periodic tasks on a minimum...
Job shop scheduling by local search
1996
We survey solution methods for the job shop scheduling problem with an emphasis on...
Scheduling periodic tasks
1996
We consider the problem of nonpreemptively scheduling periodic tasks on a minimum...
A comparative study in DSS development
1994
This feature issue (Vol. 79, No. 2) of the European Journal of Operational Research...
Scheduling periodic tasks
1996
The authors consider the problem of nonpreemptively scheduling periodic tasks on a...
The one-machine problem with delayed precedence constraints and its use in job shop scheduling
1995
The authors study the one machine scheduling problem with release and delivery times...
Periodic assignment and graph colouring
1994
The authors analyse the problem of executing periodic operations on a minimim number...
Sequential and parallel local search for the time-constrained traveling salesman problem
1993
Local search has proven to be an effective solution approach for the traveling...
Job shop scheduling by simulated annealing
1992
The authors describe an approximation algorithm for the problem of finding the minimum...
Approximation algorithms for scheduling unrelated parallel machines
1990
The authors consider the following scheduling problem. There are m parallel machines...
The parallel complexity of TSP Heuristics
1989
The authors consider eight heuristics for constructing approximate solutions to the...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers