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

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

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)

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

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)

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)

Multiprocessor scheduling with communication delays. - Bart Veltman; B. J. Lageweg; Jan Karel Lenstra (Parallel Comput., 1990)

Branch-and-Bound Algorithms for the Test Cover Problem. - Koen M. J. De Bontridder; B. J. Lageweg; Jan Karel Lenstra; James B. Orlin; Leen Stougie (ESA, 2002)