Jan Karel Lenstra - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 63 from 63

2023

On the complexity of scheduling unrelated parallel machines with limited preemptionsJan Karel Lenstra, Nodari Vakhania. orl, 51(2):187-189, March 2023. [doi]

A historical note on the complexity of scheduling problemsJan Karel Lenstra, Vitaly A. Strusevich, Milan Vlach. orl, 51(1):1-2, January 2023. [doi]

2022

In memoriam Gerhard WoegingerJan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz. scheduling, 25(5):503-505, 2022. [doi]

In memoriam Gerhard WoegingerJan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz. orl, 50(3), 2022. [doi]

2021

Local improvement algorithms for a path packing problem: A performance analysis based on linear programmingKoen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi 0001, Leen Stougie. orl, 49(1):62-68, 2021. [doi]

Amy Ward new Editor-in-ChiefJan Karel Lenstra. orl, 49(2):1, 2021. [doi]

2012

EditorialJan Karel Lenstra. orl, 40(1):1, 2012. [doi]

2007

PrefaceJos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger. TCS, 379(3):305, 2007. [doi]

2005

Linear programming models with planned lead times for supply chain operations planningJ. M. Spitter, Cor A. J. Hurkens, Ton G. de Kok, Jan Karel Lenstra, E. G. Negenman. eor, 163(3):706-720, 2005. [doi]

Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow ShopAnn Vandevelde, Han Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra. informs, 17(3):305-320, 2005. [doi]

2004

Computer-Aided Complexity Classification of Dial-a-Ride ProblemsWillem de Paepe, Jan Karel Lenstra, Jiri Sgall, René A. Sitters, Leen Stougie. informs, 16(2):120-132, 2004. [doi]

Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-HardWenci Yu, Han Hoogeveen, Jan Karel Lenstra. scheduling, 7(5):333-348, 2004. [doi]

2003

Approximation algorithms for the test cover problemKoen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie. mp, 98(1-3):477-491, 2003. [doi]

On local search for the generalized graph coloring problemTjark Vredeveld, Jan Karel Lenstra. orl, 31(1):28-34, 2003. [doi]

2002

Algorithms for Radio Link Frequency Assignment: The Calma ProjectKaren Aardal, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey R. Tiourine. ior, 50(6):968-980, 2002. [doi]

Branch-and-Bound Algorithms for the Test Cover ProblemKoen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie. esa 2002: 223-233 [doi]

2000

Local search algorithms for the radio link frequency assignment problemS. R. Tiourine, Cor A. J. Hurkens, Jan Karel Lenstra. telsys, 13(2-4):293-314, 2000.

1999

Towards a model and algorithm management system for vehicle routing and scheduling problemsM. Desrochers, C. V. Jones, Jan Karel Lenstra, Martin W. P. Savelsbergh, Leen Stougie. dss, 25(2):109-133, 1999. [doi]

1998

A local search templateRob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra. cor, 25(11):969-979, 1998. [doi]

1997

Scheduling Periodic Tasks with SlackJan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra. informs, 9(4):351-362, 1997. [doi]

Short Shop SchedulesDavid P. Williamson, Leslie A. Hall, J. A. Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey Vasil'evich Sevast'janov, David B. Shmoys. ior, 45(2):288-294, 1997. [doi]

1996

Scheduling Periodic TasksJan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra. informs, 8(4):428-435, 1996. [doi]

The Complexity of Scheduling Trees with Communication DelaysJan Karel Lenstra, Marinus Veldhorst, Bart Veltman. jal, 20(1):157-173, 1996.

Job Shop Scheduling by Local SearchRob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra. informs, 8(3):302-317, 1996. [doi]

1994

1993

Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman ProblemGerard A. P. Kindervater, Jan Karel Lenstra, Martin W. P. Savelsbergh. DAM, 42(2):211-225, 1993. [doi]

Chapter 9 Sequencing and scheduling: Algorithms and complexityEugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys. In Stephen C. Graves, Alexander H. G. Rinnooy Kan, Paul Herbert Zipkin, editors, Logistics of Production and Inventory. Volume 4 of Handbooks in Operations Research and Management Science, pages 445-522, North-Holland, 1993. [doi]

The Complexity of Scheduling Trees with Communication Delays (Extended Abstract)Jan Karel Lenstra, Marinus Veldhorst. esa 1993: 284-294

Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time WindowsL. J. J. van der Bruggen, Jan Karel Lenstra, P. C. Schuur. transci, 27(3):298-311, 1993. [doi]

1992

Guest Editors IntroductionJoseph S. B. Mitchell, Jan Karel Lenstra. informs, 4(4):357-359, 1992. [doi]

A Local Search TemplateRob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra. ppsn 1992: 67

Job Shop Scheduling by Simulated AnnealingPeter J. M. van Laarhoven, Emile H. L. Aarts, Jan Karel Lenstra. ior, 40(1):113-125, 1992. [doi]

1991

Periodic Multiprocessor SchedulingJan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels. parle 1991: 166-178

Book reviewsJan Karel Lenstra, F. Gianessi, R. W. Cottle. mmor, 35(2):167-172, 1991. [doi]

1990

Approximation Algorithms for Scheduling Unrelated Parallel MachinesJan Karel Lenstra, David B. Shmoys, Éva Tardos. mp, 46:259-271, 1990.

Multiprocessor scheduling with communication delaysBart Veltman, B. J. Lageweg, Jan Karel Lenstra. pc, 16(2-3):173-182, 1990.

1989

OR Forum - Perspectives on Parallel ComputingGerard A. P. Kindervater, Jan Karel Lenstra, A. H. G. Rinnooy Kan. ior, 37(6):985-990, 1989. [doi]

The Parallel Complexity of TSP HeuristicsGerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys. jal, 10(2):249-270, 1989.

1988

Resource-constrained project scheduling: an international exercise in DSS developmentJac M. Anthonisse, Kees M. van Hee, Jan Karel Lenstra. dss, 4(2):249-257, 1988. [doi]

Behind the screen: DSS from an OR point of viewJac M. Anthonisse, Jan Karel Lenstra, Martin W. P. Savelsbergh. dss, 4(4):413-419, 1988. [doi]

Introduction - Special Focus and Decision Support Systems (DSS)Paul Gray, Jan Karel Lenstra. ior, 36(6):823-825, 1988. [doi]

1987

Approximation Algorithms for Scheduling Unrelated Parallel MachinesJan Karel Lenstra, David B. Shmoys, Éva Tardos. focs 1987: 217-224

1986

An introduction to parallelism in combinatorial optimizationGerard A. P. Kindervater, Jan Karel Lenstra. DAM, 14(2):135-156, 1986. [doi]

1984

A framework for the probabilistic analysis of hierarchical planning systemsJan Karel Lenstra, A. H. G. Rinnooy Kan, Leen Stougie. anor, 1(1):23-42, 1984. [doi]

1983

1982

Computer-Aided Complexity Classification of Combinatorial ProblemsB. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan. CACM, 25(11):817-822, 1982.

ErratumEugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan. mor, 7(4):635, 1982. [doi]

Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of MachinesKatsuto Nakajima, S. Louis Hakimi, Jan Karel Lenstra. SICOMP, 11(3):512-520, 1982.

1981

1980

Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time AlgorithmsEugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan. SICOMP, 9(3):558-565, 1980.

1978

The complexity of the network design problemDavid S. Johnson, Jan Karel Lenstra, A. H. G. Rinnooy Kan. networks, 8(4):279-285, 1978. [doi]

A General Bounding Scheme for the Permutation Flow-Shop ProblemB. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan. ior, 26(1):53-67, 1978. [doi]

Complexity of Scheduling under Precedence ConstraintsJan Karel Lenstra, A. H. G. Rinnooy Kan. ior, 26(1):22-35, 1978. [doi]

1976

On general routing problemsJan Karel Lenstra, A. H. G. Rinnooy Kan. networks, 6(3):273-280, 1976. [doi]

1975

Minimizing Total Costs in One-Machine SchedulingA. H. G. Rinnooy Kan, B. J. Lageweg, Jan Karel Lenstra. ior, 23(5):908-927, 1975. [doi]

1974

Technical Note - Clustering a Data Array and the Traveling-Salesman ProblemJan Karel Lenstra. ior, 22(2):413-414, 1974. [doi]

Sign in or sign up to see more results.

runs on WebDSL