Leslie A. Hall - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 14 from 14

2002

Multistars and directed flow formulationsLuis Gouveia, Leslie A. Hall. networks, 40(4):188-201, 2002. [doi]

1998

Approximability of flow shop schedulingLeslie A. Hall. mp, 82:175-190, 1998.

1997

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation AlgorithmsLeslie A. Hall, Andreas S. Schulz, David B. Shmoys, Joel Wein. mor, 22(3):513-544, 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

The Strongest Facets of the Acyclic Subgraph Polytope Are UnknownMichel X. Goemans, Leslie A. Hall. ipco 1996: 415-429

Scheduling to Minimize Average Completion Time: Off-line and On-line AlgorithmsLeslie A. Hall, David B. Shmoys, Joel Wein. soda 1996: 142-151

1995

Approximability of Flow Shop SchedulingLeslie A. Hall. focs 1995: 82-91

1994

A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling ProblemLeslie A. Hall. mor, 19(1):68-85, 1994. [doi]

1993

A Note on Generalizing the Maximum Lateness Criterion for SchedulingLeslie A. Hall. DAM, 47(2):129-137, 1993. [doi]

Two-thirds is sharp for affine scalingLeslie A. Hall, Robert J. Vanderbei. orl, 13(4):197-201, 1993. [doi]

1992

A Polyhedral Intersection Theorem for Capacitated Spanning TreesLeslie A. Hall, Thomas L. Magnanti. mor, 17(2):398-410, 1992. [doi]

Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic BetterLeslie A. Hall, David B. Shmoys. mor, 17(1):22-35, 1992. [doi]

1990

Near-Optimal Sequencing with Precedence ConstraintsLeslie A. Hall, David B. Shmoys. ipco 1990: 249-260

1989

Approximation Schemes for Constrained Scheduling ProblemsLeslie A. Hall, David B. Shmoys. focs 1989: 134-139

Sign in or sign up to see more results.

runs on WebDSL