#### Filter Results:

- Full text PDF available (37)

#### Publication Year

1974

2017

- This year (3)
- Last 5 years (4)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jan Karel Lenstra, David B. Shmoys, Ã‰va Tardos
- 28th Annual Symposium on Foundations of Computerâ€¦
- 1987

We consider the following scheduling problem. There are m parallel machines and n independent jobs. Each job is to be assigned to one of the machines. The processing of job j on machine i requires time pij. The objective is to find a schedule that minimizes the makespan. Our main result is a polynomial algorithm which constructs a schedule that isâ€¦ (More)

- References, Milind Dawande, +12 authors A H G Rinnooy Kan
- 1993

item in the big bin and obtains a profit of 1 while OPT = 2. This also shows that ordering bins in non-increasing capacities does not help improve the performance of Greedy. 5 Conclusions An interesting aspect of our guessing strategy is that it is completely independent of the number of bins and their capacities. This might prove to be useful in otherâ€¦ (More)

- Jacek Blazewicz, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan
- Discrete Applied Mathematics
- 1983

- Peter J. M. van Laarhoven, Emile H. L. Aarts, Jan Karel Lenstra
- Operations Research
- 1992

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and youâ€¦ (More)

- Jan Karel Lenstra, Alexander H. G. Rinnooy Kan
- Operations Research
- 1978

- David S. Johnson, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan
- Networks
- 1978

- Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra
- INFORMS Journal on Computing
- 1996

We survey solution methods for the job shop scheduling problem with an emphasis on local search. Both deterministic and randomized local search methods as well as the proposed neighborhoods are discussed. We compare the computational performance of the various methods in terms of their eeectiveness and eeciency on a standard set of problem instances. In theâ€¦ (More)

- Jan Karel Lenstra, Alexander H. G. Rinnooy Kan
- Networks
- 1976

- Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan
- SIAM J. Comput.
- 1980

Suppose that an independence system (E, ) is characterized by a subroutine which indicates in unit time whether or not a given subset of E is independent. It is shown that there is no algorithm for generating all the K maximal independent sets of such an independence system in time polynomial in IEI and K, unless V. However, it is possible to apply ideas ofâ€¦ (More)

- Jan Karel Lenstra, Alexander H. G. Rinnooy Kan
- Networks
- 1981

The complexity of a class of vehicle routing and scheduling problems is investigated. We review known NP-hardness results and compile the results on the worst-case performance of approximation algorithms. Some directions for future research are suggested. The presentation is based on two discussion sessions during the Workshop to Investigate Futureâ€¦ (More)