Leslie A. Hall

According to our database1, Leslie A. Hall authored at least 13 papers between 1989 and 2002.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2002
Multistars and directed flow formulations.
Networks, 2002

1998
Approximability of flow shop scheduling.
Math. Program., 1998

1997
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms.
Math. Oper. Res., 1997

Short Shop Schedules.
Oper. Res., 1997

1996
Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

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

1993
Two-thirds is sharp for affine scaling.
Oper. Res. Lett., 1993

A Note on Generalizing the Maximum Lateness Criterion for Scheduling.
Discret. Appl. Math., 1993

1992
Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better.
Math. Oper. Res., 1992

A Polyhedral Intersection Theorem for Capacitated Spanning Trees.
Math. Oper. Res., 1992

1990
Near-Optimal Sequencing with Precedence Constraints.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989
Approximation Schemes for Constrained Scheduling Problems
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989


  Loading...