Остановите войну!
for scientists:
default search action
Jan Karel Lenstra
- > Home > Persons > Jan Karel Lenstra
Publications
- 1993
- [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 - 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) - 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) - 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) - 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)
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 2023-09-29 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint