Approximation Schemes for Constrained Scheduling Problems - Leslie A. Hall; David B. Shmoys (FOCS, 1989)

Near-Optimal Sequencing with Precedence Constraints. - Leslie A. Hall; David B. Shmoys (IPCO, 1990)

A Polyhedral Intersection Theorem for Capacitated Spanning Trees. - Leslie A. Hall; Thomas L. Magnanti (Math. Oper. Res., 1992)

Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better. - Leslie A. Hall; David B. Shmoys (Math. Oper. Res., 1992)

A Note on Generalizing the Maximum Lateness Criterion for Scheduling. - Leslie A. Hall (Discret. Appl. Math., 1993)

Two-thirds is sharp for affine scaling. - Leslie A. Hall; Robert J. Vanderbei (Oper. Res. Lett., 1993)

A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem. - Leslie A. Hall (Math. Oper. Res., 1994)

The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown. - Michel X. Goemans; Leslie A. Hall (IPCO, 1996)

Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms. - Leslie A. Hall; David B. Shmoys; Joel Wein (SODA, 1996)

Short Shop Schedules. - David P. Williamson; Leslie A. Hall; J. A. Hoogeveen; Cor A. J. Hurkens; Jan Karel Lenstra; Sergey Vasil'evich Sevast'janov; David B. Shmoys (Oper. Res., 1997)

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms. - Leslie A. Hall; Andreas S. Schulz; David B. Shmoys; Joel Wein (Math. Oper. Res., 1997)

Approximability of flow shop scheduling. - Leslie A. Hall (Math. Program., 1998)

Multistars and directed flow formulations. - Luis Eduardo Neves Gouveia; Leslie A. Hall (Networks, 2002)