Jeffrey B. Sidney

Comput. Oper. Res., 2012

2010

Scheduling a deteriorating maintenance activity on a single machine.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2010

The Browne-Yechiali single-machine sequence is optimal for flow-shops.

[BibT_eX]

[DOI]

Assaf Sarig

Comput. Oper. Res., 2010

2005

Note on scheduling with general learning curves to minimize the number of tardy jobs.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2005

2003

Scheduling with general job-dependent learning curves.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2003

2001

Scheduling in dual gripper robotic cells for productivity gains.

[BibT_eX]

[DOI]

Suresh P. Sethi

Chelliah Sriskandarajah

IEEE Trans. Robotics Autom., 2001

2000

A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups.

[BibT_eX]

[DOI]

Chris N. Potts

Chelliah Sriskandarajah

Oper. Res. Lett., 2000

1998

Scheduling in broadcast networks.

[BibT_eX]

[DOI]

Nicholas G. Hall

Wei-Ping Liu

Networks, 1998

1996

Ordinal algorithms for parallel machine scheduling.

[BibT_eX]

[DOI]

Wei-Ping Liu

André van Vliet

Oper. Res. Lett., 1996

Bin packing using semi-ordinal data.

[BibT_eX]

[DOI]

Wei-Ping Liu

Oper. Res. Lett., 1996

1993

Batching and Scheduling in FMS Hubs: Flow Time Considerations.

[BibT_eX]

[DOI]

Daniel E. Lane

Oper. Res., 1993

1992

A Distributed Selection Algorithm and its Expected Communication Complexity.

[BibT_eX]

[DOI]

Stuart J. Sidney

Theor. Comput. Sci., 1992

1991

Average properties of two-dimensional partial orders.

[BibT_eX]

[DOI]

Stuart J. Sidney

Art Warburton

Networks, 1991

1989

Geometric Containment and Partial Orders.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1989

1988

On the Expected Complexity of Distributed Selection.

[BibT_eX]

[DOI]

Michael Scheutzow

J. Parallel Distributed Comput., 1988

1987

Geometric Containment and Vector Dominance.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions.

[BibT_eX]

[DOI]

Clyde L. Monma

Math. Oper. Res., 1987

On the Expected Complexity of Distributed Selection.

[BibT_eX]

[DOI]

Stuart J. Sidney

Proceedings of the STACS 87, 1987

1986

Shout echo selection in distributed files.

[BibT_eX]

[DOI]

Doron Rotem

Networks, 1986

Optimal Sequencing by Modular Decomposition: Polynomial Algorithms.

[BibT_eX]

[DOI]

George Steiner

Oper. Res., 1986

1985

Distributed Sorting.

[BibT_eX]

[DOI]

Doron Rotem

IEEE Trans. Computers, 1985

Interpolation-Binary Search.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

Geometric Containment is not Reducible to Pareto Dominance.

[BibT_eX]

[DOI]

Proceedings of the STACS 85, 1985

1983

Sequencing and scheduling-an introduction to the mathematics of the job-shop, by Simon French, Wiley, 1982, 245 pp. Price: $49.95.

[BibT_eX]

[DOI]

Networks, 1983

1981

A Decomposition Algorithm for Sequencing with General Precedence Constraints.

[BibT_eX]

[DOI]

Math. Oper. Res., 1981

1979

Sequencing with Series-Parallel Precedence Constraints.

[BibT_eX]

[DOI]

Clyde L. Monma

Math. Oper. Res., 1979

The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations.

[BibT_eX]

[DOI]

Oper. Res., 1979

1977

Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties.

[BibT_eX]

[DOI]

Oper. Res., 1977

1975

Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs.

[BibT_eX]

[DOI]