default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Karel Lenstra
Person information
- affiliation: Eindhoven University of Technology, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j58]Jan Karel Lenstra, Vitaly A. Strusevich, Milan Vlach
:
A historical note on the complexity of scheduling problems. Oper. Res. Lett. 51(1): 1-2 (2023)- [j57]Jan Karel Lenstra, Nodari Vakhania:
On the complexity of scheduling unrelated parallel machines with limited preemptions. Oper. Res. Lett. 51(2): 187-189 (2023) - 2022
- [j56]Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz:
In memoriam Gerhard Woeginger. Oper. Res. Lett. 50(3): iii (2022) - [j55]Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz:
In memoriam Gerhard Woeginger. J. Sched. 25(5): 503-505 (2022) - 2021
- [j54]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:
Local improvement algorithms for a path packing problem: A performance analysis based on linear programming. Oper. Res. Lett. 49(1): 62-68 (2021) - [j53]Jan Karel Lenstra:
Amy Ward new Editor-in-Chief. Oper. Res. Lett. 49(2): 1 (2021) - 2020
- [i1]Jan Karel Lenstra, David B. Shmoys:
Elements of Scheduling. CoRR abs/2001.06005 (2020)
2010 – 2019
- 2012
- [j52]Jan Karel Lenstra:
Editorial. Oper. Res. Lett. 40(1): 1 (2012)
2000 – 2009
- 2007
- [j51]Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger:
Preface. Theor. Comput. Sci. 379(3): 305 (2007) - 2005
- [j50]J. M. Spitter, Cor A. J. Hurkens, Ton G. de Kok, Jan Karel Lenstra, Ebbe G. Negenman:
Linear programming models with planned lead times for supply chain operations planning. Eur. J. Oper. Res. 163(3): 706-720 (2005) - [j49]Ann Vandevelde, Han Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra:
Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop. INFORMS J. Comput. 17(3): 305-320 (2005) - 2004
- [j48]Willem de Paepe, Jan Karel Lenstra, Jirí Sgall, René A. Sitters, Leen Stougie:
Computer-Aided Complexity Classification of Dial-a-Ride Problems. INFORMS J. Comput. 16(2): 120-132 (2004) - [j47]Wenci Yu, Han Hoogeveen, Jan Karel Lenstra:
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard. J. Sched. 7(5): 333-348 (2004) - 2003
- [j46]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:
Approximation algorithms for the test cover problem. Math. Program. 98(1-3): 477-491 (2003) - [j45]Tjark Vredeveld, Jan Karel Lenstra:
On local search for the generalized graph coloring problem. Oper. Res. Lett. 31(1): 28-34 (2003) - [e1]Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger:
Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings. Lecture Notes in Computer Science 2719, Springer 2003, ISBN 3-540-40493-7 [contents] - 2002
- [j44]Karen I. Aardal, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey R. Tiourine:
Algorithms for Radio Link Frequency Assignment: The Calma Project. Oper. Res. 50(6): 968-980 (2002) - [c5]Koen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie:
Branch-and-Bound Algorithms for the Test Cover Problem. ESA 2002: 223-233 - 2000
- [j43]Sergey R. Tiourine, Cor A. J. Hurkens, Jan Karel Lenstra:
Local search algorithms for the radio link frequency assignment problem. Telecommun. Syst. 13(2-4): 293-314 (2000)
1990 – 1999
- 1999
- [j42]Martin Desrochers, Christopher V. Jones, Jan Karel Lenstra, Martin W. P. Savelsbergh, Leen Stougie:
Towards a model and algorithm management system for vehicle routing and scheduling problems. Decis. Support Syst. 25(2): 109-133 (1999) - 1998
- [j41]Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra:
A local search template. Comput. Oper. Res. 25(11): 969-979 (1998) - 1997
- [j40]Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra:
Scheduling Periodic Tasks with Slack. INFORMS J. Comput. 9(4): 351-362 (1997) - [j39]David P. Williamson, Leslie A. Hall, J. A. Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey Vasil'evich Sevast'janov, David B. Shmoys:
Short Shop Schedules. Oper. Res. 45(2): 288-294 (1997) - 1996
- [j38]Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra:
Job Shop Scheduling by Local Search. INFORMS J. Comput. 8(3): 302-317 (1996) - [j37]Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra:
Scheduling Periodic Tasks. INFORMS J. Comput. 8(4): 428-435 (1996) - [j36]Jan Karel Lenstra, Marinus Veldhorst, Bart Veltman:
The Complexity of Scheduling Trees with Communication Delays. J. Algorithms 20(1): 157-173 (1996) - 1994
- [j35]Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels:
Periodic Assignment and Graph Colouring. Discret. Appl. Math. 51(3): 291-305 (1994) - [j34]Emile H. L. Aarts, Peter J. M. van Laarhoven, Jan Karel Lenstra, Nico L. J. Ulder:
A Computational Study of Local Search Algorithms for Job Shop Scheduling. INFORMS J. Comput. 6(2): 118-125 (1994) - [j33]J. A. Hoogeveen, Jan Karel Lenstra, Bart Veltman:
Three, four, five, six, or the complexity of scheduling with communication delays. Oper. Res. Lett. 16(3): 129-137 (1994) - 1993
- [j32]Gerard A. P. Kindervater, Jan Karel Lenstra, Martin W. P. Savelsbergh:
Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem. Discret. Appl. Math. 42(2): 211-225 (1993) - [j31]L. J. J. van der Bruggen, Jan Karel Lenstra, P. C. Schuur:
Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows. Transp. Sci. 27(3): 298-311 (1993) - [c4]Jan Karel Lenstra, Marinus Veldhorst:
The Complexity of Scheduling Trees with Communication Delays (Extended Abstract). ESA 1993: 284-294 - [p1]Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys:
Chapter 9 Sequencing and scheduling: Algorithms and complexity. Logistics of Production and Inventory 1993: 445-522 - 1992
- [j30]Joseph S. B. Mitchell, Jan Karel Lenstra:
Guest Editors' Introduction. INFORMS J. Comput. 4(4): 357-359 (1992) - [j29]Peter J. M. van Laarhoven, Emile H. L. Aarts, Jan Karel Lenstra:
Job Shop Scheduling by Simulated Annealing. Oper. Res. 40(1): 113-125 (1992) - [c3]Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra:
A Local Search Template. PPSN 1992: 67- - 1991
- [j28]Jan Karel Lenstra, F. Gianessi, Richard W. Cottle:
Book reviews. ZOR Methods Model. Oper. Res. 35(2): 167-172 (1991) - [c2]Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels:
Periodic Multiprocessor Scheduling. PARLE (1) 1991: 166-178 - 1990
- [j27]Jan Karel Lenstra, David B. Shmoys, Éva Tardos:
Approximation Algorithms for Scheduling Unrelated Parallel Machines. Math. Program. 46: 259-271 (1990) - [j26]Bart Veltman, B. J. Lageweg, Jan Karel Lenstra:
Multiprocessor scheduling with communication delays. Parallel Comput. 16(2-3): 173-182 (1990)
1980 – 1989
- 1989
- [j25]Gerard A. P. Kindervater, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
OR Forum - Perspectives on Parallel Computing. Oper. Res. 37(6): 985-990 (1989) - [j24]Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys:
The Parallel Complexity of TSP Heuristics. J. Algorithms 10(2): 249-270 (1989) - 1988
- [j23]Jac M. Anthonisse, Kees M. van Hee, Jan Karel Lenstra:
Resource-constrained project scheduling: an international exercise in DSS development. Decis. Support Syst. 4(2): 249-257 (1988) - [j22]Jac M. Anthonisse, Jan Karel Lenstra, Martin W. P. Savelsbergh:
Behind the screen: DSS from an OR point of view. Decis. Support Syst. 4(4): 413-419 (1988) - [j21]Paul Gray, Jan Karel Lenstra:
Introduction - Special Focus and Decision Support Systems (DSS). Oper. Res. 36(6): 823-825 (1988) - 1987
- [c1]Jan Karel Lenstra, David B. Shmoys, Éva Tardos:
Approximation Algorithms for Scheduling Unrelated Parallel Machines. FOCS 1987: 217-224 - 1986
- [j20]Gerard A. P. Kindervater, Jan Karel Lenstra:
An introduction to parallelism in combinatorial optimization. Discret. Appl. Math. 14(2): 135-156 (1986) - 1984
- [j19]Jan Karel Lenstra, A. H. G. Rinnooy Kan, Leen Stougie:
A framework for the probabilistic analysis of hierarchical planning systems. Ann. Oper. Res. 1(1): 23-42 (1984) - 1983
- [j18]Jacek Blazewicz, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Scheduling subject to resource constraints: classification and complexity. Discret. Appl. Math. 5(1): 11-24 (1983) - [j17]Marshall L. Fisher, B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan:
Surrogate duality relaxation for job shop scheduling. Discret. Appl. Math. 5(1): 65-75 (1983) - [j16]K. R. Baker, Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints. Oper. Res. 31(2): 381-386 (1983) - [j15]M. A. H. Dempster, Marshall L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems. Math. Oper. Res. 8(4): 525-537 (1983) - 1982
- [j14]B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Computer-Aided Complexity Classification of Combinatorial Problems. Commun. ACM 25(11): 817-822 (1982) - [j13]Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Erratum. Math. Oper. Res. 7(4): 635 (1982) - [j12]Katsuto Nakajima, S. Louis Hakimi, Jan Karel Lenstra:
Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines. SIAM J. Comput. 11(3): 512-520 (1982) - 1981
- [j11]Michael A. H. Dempster, Marshall L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Analytical Evaluation of Hierarchical Planning Systems. Oper. Res. 29(4): 707-716 (1981) - [j10]Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Minimizing Maximum Lateness in a Two-Machine Open Shop. Math. Oper. Res. 6(1): 153-158 (1981) - [j9]Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Complexity of vehicle routing and scheduling problems. Networks 11(2): 221-227 (1981) - 1980
- [j8]Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms. SIAM J. Comput. 9(3): 558-565 (1980)
1970 – 1979
- 1978
- [j7]Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Complexity of Scheduling under Precedence Constraints. Oper. Res. 26(1): 22-35 (1978) - [j6]B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
A General Bounding Scheme for the Permutation Flow-Shop Problem. Oper. Res. 26(1): 53-67 (1978) - [j5]Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Technical Note - On the Expected Performance of Branch-and-Bound Algorithms. Oper. Res. 26(2): 347-349 (1978) - [j4]David S. Johnson, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
The complexity of the network design problem. Networks 8(4): 279-285 (1978) - 1976
- [j3]Jan Karel Lenstra, A. H. G. Rinnooy Kan:
On general routing problems. Networks 6(3): 273-280 (1976) - 1975
- [j2]A. H. G. Rinnooy Kan, B. J. Lageweg, Jan Karel Lenstra:
Minimizing Total Costs in One-Machine Scheduling. Oper. Res. 23(5): 908-927 (1975) - 1974
- [j1]Jan Karel Lenstra:
Technical Note - Clustering a Data Array and the Traveling-Salesman Problem. Oper. Res. 22(2): 413-414 (1974)
Coauthor Index
aka: A. H. G. Rinnooy Kan
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
