John J. Bartholdi III

According to our database1, John J. Bartholdi III authored at least 25 papers between 1980 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
Building a Self-Organizing Urban Bus Route.
Proceedings of the Sixth IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops, 2012

2011
Centralizing Inventory in Supply Chains by Using Shapley Value to Allocate the Profits.
Manuf. Serv. Oper. Manag., 2011

2010
Self-organizing logistics systems.
Annu. Rev. Control., 2010

2006
Bucket brigades on in-tree assembly networks.
Eur. J. Oper. Res., 2006

2005
Using Bucket Brigades to Migrate from Craft Manufacturing to Assembly Lines.
Manuf. Serv. Oper. Manag., 2005

2004
Multiresolution Indexing of Triangulated Irregular Networks.
IEEE Trans. Vis. Comput. Graph., 2004

The Best Shape for a Crossdock.
Transp. Sci., 2004

The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.
Oper. Res. Lett., 2004

2001
Vertex-labeling algorithms for the Hilbert spacefilling curve.
Softw. Pract. Exp., 2001

Performance of Bucket Brigades When Work Is Stochastic.
Oper. Res., 2001

Continuous indexing of hierarchical subdivisions of the globe.
Int. J. Geogr. Inf. Sci., 2001

2000
Reducing Labor Costs in an LTL Crossdocking Terminal.
Oper. Res., 2000

Heuristics for Balancing Turbine Fans.
Oper. Res., 2000

1999
Dynamics of Two- and Three-Worker "Bucket Brigade" Production Lines.
Oper. Res., 1999

1996
A Probabilistic Analysis of Two-Machine Flowshops.
Oper. Res., 1996

A Production Line that Balances Itself.
Oper. Res., 1996

1992
Balanced Loading.
Oper. Res., 1992

1990
Scheduling Interviews for a Job Fair.
Oper. Res., 1990

1989
Spacefilling curves and the planar travelling salesman problem.
J. ACM, 1989

1988
A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms.
Oper. Res., 1988

1983
A Fast Heuristic Based on Spacefilling Curves for Minimum-Weight Matching in the Plane.
Inf. Process. Lett., 1983

1982
An O(N log N) planar travelling salesman heuristic based on spacefilling curves.
Oper. Res. Lett., 1982

A good submatrix is hard to find.
Oper. Res. Lett., 1982

1981
A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering.
Oper. Res., 1981

1980
Cyclic Scheduling via Integer Programs with Circular Ones.
Oper. Res., 1980


  Loading...