Minimizing Total Costs in One-Machine Scheduling. - A. H. G. Rinnooy Kan; B. J. Lageweg; Jan Karel Lenstra (Oper. Res., 1975)

Technical Note - On Mitten's Axioms for Branch-and-Bound. - A. H. G. Rinnooy Kan (Oper. Res., 1976)

On general routing problems. - Jan Karel Lenstra; A. H. G. Rinnooy Kan (Networks, 1976)

A General Bounding Scheme for the Permutation Flow-Shop Problem. - B. J. Lageweg; Jan Karel Lenstra; A. H. G. Rinnooy Kan (Oper. Res., 1978)

Complexity of Scheduling under Precedence Constraints. - Jan Karel Lenstra; A. H. G. Rinnooy Kan (Oper. Res., 1978)

Technical Note - On the Expected Performance of Branch-and-Bound Algorithms. - Jan Karel Lenstra; A. H. G. Rinnooy Kan (Oper. Res., 1978)

The complexity of the network design problem. - David S. Johnson 001; Jan Karel Lenstra; A. H. G. Rinnooy Kan (Networks, 1978)

Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms. - Eugene L. Lawler; Jan Karel Lenstra; A. H. G. Rinnooy Kan (SIAM J. Comput., 1980)

Analytical Evaluation of Hierarchical Planning Systems. - Michael A. H. Dempster; Marshall L. Fisher; L. Jansen; B. J. Lageweg; Jan Karel Lenstra; A. H. G. Rinnooy Kan (Oper. Res., 1981)

Minimizing Maximum Lateness in a Two-Machine Open Shop. - Eugene L. Lawler; Jan Karel Lenstra; A. H. G. Rinnooy Kan (Math. Oper. Res., 1981)

Complexity of vehicle routing and scheduling problems. - Jan Karel Lenstra; A. H. G. Rinnooy Kan (Networks, 1981)

Computer-Aided Complexity Classification of Combinatorial Problems. - B. J. Lageweg; Jan Karel Lenstra; A. H. G. Rinnooy Kan (Commun. ACM, 1982)

Erratum. - Eugene L. Lawler; Jan Karel Lenstra; A. H. G. Rinnooy Kan (Math. Oper. Res., 1982)

A stochastic method for global optimization. - C. G. E. Boender; A. H. G. Rinnooy Kan; G. T. Timmer; Leen Stougie (Math. Program., 1982)

Scheduling subject to nonrenewable-resource constraints. - J. Carlier; A. H. G. Rinnooy Kan (Oper. Res. Lett., 1982)

An Efficient Dynamic Selection Method. - J. T. Postmus; A. H. G. Rinnooy Kan; G. T. Timmer (Commun. ACM, 1983)

The asymptotic behaviour of a distributive sorting method. - W. B. van Dam; J. B. G. Frenk; Alexander H. G. Rinnooy Kan (Computing, 1983)

Scheduling subject to resource constraints: classification and complexity. - Jacek Blazewicz; Jan Karel Lenstra; A. H. G. Rinnooy Kan (Discret. Appl. Math., 1983)

Surrogate duality relaxation for job shop scheduling. - Marshall L. Fisher; B. J. Lageweg; Jan Karel Lenstra; Alexander H. G. Rinnooy Kan (Discret. Appl. Math., 1983)

Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints. - K. R. Baker; Eugene L. Lawler; Jan Karel Lenstra; A. H. G. Rinnooy Kan (Oper. Res., 1983)

Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems. - M. A. H. Dempster; Marshall L. Fisher; L. Jansen; B. J. Lageweg; Jan Karel Lenstra; A. H. G. Rinnooy Kan (Math. Oper. Res., 1983)

Capacity expansion - analysis of simple models with applications, by John Freidenfels, North Holland, 1981, 291 pp. Price: $39.50. - Alexander H. G. Rinnooy Kan (Networks, 1983)

A hierarchical scheduling problem with a well-solvable second stage. - J. B. G. Frenk; A. H. G. Rinnooy Kan; Leen Stougie (Ann. Oper. Res., 1984)

A framework for the probabilistic analysis of hierarchical planning systems. - Jan Karel Lenstra; A. H. G. Rinnooy Kan; Leen Stougie (Ann. Oper. Res., 1984)

Hierarchical vehicle routing problems. - Alberto Marchetti-Spaccamela; A. H. G. Rinnooy Kan; Leen Stougie (Networks, 1984)

Preface. - A. H. G. Rinnooy Kan (Discret. Appl. Math., 1985)

Asymptotic Properties of the Quadratic Assignment Problem. - J. B. G. Frenk; M. van Houweninge; A. H. G. Rinnooy Kan (Math. Oper. Res., 1985)

Bounds and Heuristics for Capacitated Routing Problems. - Mordecai Haimovich; Alexander H. G. Rinnooy Kan (Math. Oper. Res., 1985)

The rate of convergence to optimality of the LPT rule. - J. B. G. Frenk; A. H. G. Rinnooy Kan (Discret. Appl. Math., 1986)

An introduction to the analysis of approximation algorithms. - A. H. G. Rinnooy Kan (Discret. Appl. Math., 1986)

Order statistics and the linear assignment problem. - J. B. G. Frenk; M. van Houweninge; Alexander H. G. Rinnooy Kan (Computing, 1987)

Vehicle Routing with Time Windows. - Antoon W. J. Kolen; A. H. G. Rinnooy Kan; Harry W. J. M. Trienekens (Oper. Res., 1987)

The Asymptotic Optimality of the LPT Rule. - J. B. G. Frenk; A. H. G. Rinnooy Kan (Math. Oper. Res., 1987)

Hit-and-run algorithms for the identification of nonredundant linear inequalities. - H. C. P. Berbee; C. G. E. Boender; A. H. G. Rinnooy Kan; C. L. Scheffer; Robert L. Smith 002; Jan Telgen (Math. Program., 1987)

Bayesian stopping rules for multistart global optimization methods. - C. G. E. Boender; A. H. G. Rinnooy Kan (Math. Program., 1987)

Stochastic global optimization methods part I: Clustering methods. - Alexander H. G. Rinnooy Kan; G. T. Timmer (Math. Program., 1987)

Stochastic global optimization methods part II: Multi level methods. - Alexander H. G. Rinnooy Kan; G. T. Timmer (Math. Program., 1987)

A simulation tool for the performance evaluation of parallel branch and bound algorithms. - Arie de Bruin; Alexander H. G. Rinnooy Kan; Harry W. J. M. Trienekens (Math. Program., 1988)

Single Machine Flow-Time Scheduling With a Single Breakdown. - Igal Adiri; John L. Bruno; Esther Frostig; A. H. G. Rinnooy Kan (Acta Informatica, 1989)

OR Forum - Perspectives on Parallel Computing. - Gerard A. P. Kindervater; Jan Karel Lenstra; A. H. G. Rinnooy Kan (Oper. Res., 1989)

Concurrent Stochastic Methods for Global Optimization. - Richard H. Byrd; Cornelius L. Dert; Alexander H. G. Rinnooy Kan; Robert B. Schnabel (Math. Program., 1990)

A Probabilistic Analysis of the Multiknapsack Value Function. - M. Meanti; A. H. G. Rinnooy Kan; Leen Stougie; Carlo Vercellis (Math. Program., 1990)

Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra. - C. G. E. Boender; Richard J. Caron; J. Fred McDonald; A. H. G. Rinnooy Kan; H. Edwin Romeijn; Robert L. Smith 002; Jan Telgen; A. C. F. Vorst (Oper. Res., 1991)

Probabilistic Analysis of Algorithms for Dual Bin Packing Problems. - János Csirik; J. B. G. Frenk; Gábor Galambos; A. H. G. Rinnooy Kan (J. Algorithms, 1991)

On when to stop sampling for the maximum. - C. G. E. Boender; A. H. G. Rinnooy Kan (J. Glob. Optim., 1991)

Machine allocation algorithms for job shop manufacturing. - Mario van Vliet; Alexander H. G. Rinnooy Kan (J. Intell. Manuf., 1991)

Preface. - Stephen C. Graves; Alexander H. G. Rinnooy Kan; Paul Herbert Zipkin (Logistics of Production and Inventory, 1993)

Chapter 9 Sequencing and scheduling: Algorithms and complexity. - Eugene L. Lawler; Jan Karel Lenstra; Alexander H. G. Rinnooy Kan; David B. Shmoys (Logistics of Production and Inventory, 1993)

A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem. - A. H. G. Rinnooy Kan; Leen Stougie; Carlo Vercellis (Discret. Appl. Math., 1993)

Decomposition in general mathematical programming. - Olaf E. Flippo; Alexander H. G. Rinnooy Kan (Math. Program., 1993)

Probabilistic Analysis of Packing and Partitioning Algorithms (E. G. Coffman, Jr. and George S. Lueker). - Alexander H. G. Rinnooy Kan; A. van Vliet (SIAM Rev., 1993)

Sensitivity Analysis of List Scheduling Heuristics. - Antoon W. J. Kolen; A. H. G. Rinnooy Kan; C. P. M. van Hoesel; Albert P. M. Wagelmans (Discret. Appl. Math., 1994)

Average Case Analysis of a Heuristic for the Assignment Problem. - Richard M. Karp; Alexander H. G. Rinnooy Kan; Rakesh V. Vohra (Math. Oper. Res., 1994)

Managing a multi-billion dollar IT Budget. - A. H. G. Rinnooy Kan (ICSM, 2003)