Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs. - Jeffrey B. Sidney (Oper. Res., 1975)

Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties. - Jeffrey B. Sidney (Oper. Res., 1977)

The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations. - Jeffrey B. Sidney (Oper. Res., 1979)

Sequencing with Series-Parallel Precedence Constraints. - Clyde L. Monma; Jeffrey B. Sidney (Math. Oper. Res., 1979)

A Decomposition Algorithm for Sequencing with General Precedence Constraints. - Jeffrey B. Sidney (Math. Oper. Res., 1981)

Sequencing and scheduling-an introduction to the mathematics of the job-shop, by Simon French, Wiley, 1982, 245 pp. Price: $49.95. - Jeffrey B. Sidney (Networks, 1983)

Geometric Containment is not Reducible to Pareto Dominance. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney; Jorge Urrutia (STACS, 1985)

Interpolation-Binary Search. - Nicola Santoro; Jeffrey B. Sidney (Inf. Process. Lett., 1985)

Distributed Sorting. - Doron Rotem; Nicola Santoro; Jeffrey B. Sidney (IEEE Trans. Computers, 1985)

Optimal Sequencing by Modular Decomposition: Polynomial Algorithms. - Jeffrey B. Sidney; George Steiner (Oper. Res., 1986)

Shout echo selection in distributed files. - Doron Rotem; Nicola Santoro; Jeffrey B. Sidney (Networks, 1986)

On the Expected Complexity of Distributed Selection. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney (STACS, 1987)

Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions. - Clyde L. Monma; Jeffrey B. Sidney (Math. Oper. Res., 1987)

Geometric Containment and Vector Dominance. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney; Jorge Urrutia (Theor. Comput. Sci., 1987)

On the Expected Complexity of Distributed Selection. - Nicola Santoro; Michael Scheutzow; Jeffrey B. Sidney (J. Parallel Distributed Comput., 1988)

Geometric Containment and Partial Orders. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney; Jorge Urrutia (SIAM J. Discret. Math., 1989)

Average properties of two-dimensional partial orders. - Jeffrey B. Sidney; Stuart J. Sidney; Art Warburton (Networks, 1991)

A Distributed Selection Algorithm and its Expected Communication Complexity. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney (Theor. Comput. Sci., 1992)

Batching and Scheduling in FMS Hubs: Flow Time Considerations. - Daniel E. Lane; Jeffrey B. Sidney (Oper. Res., 1993)

Bin packing using semi-ordinal data. - Wei-Ping Liu; Jeffrey B. Sidney (Oper. Res. Lett., 1996)

Ordinal algorithms for parallel machine scheduling. - Wei-Ping Liu; Jeffrey B. Sidney; André van Vliet (Oper. Res. Lett., 1996)

Scheduling in broadcast networks. - Nicholas G. Hall; Wei-Ping Liu; Jeffrey B. Sidney (Networks, 1998)

A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups. - Jeffrey B. Sidney; Chris N. Potts; Chelliah Sriskandarajah (Oper. Res. Lett., 2000)

Scheduling in dual gripper robotic cells for productivity gains. - Suresh P. Sethi; Jeffrey B. Sidney; Chelliah Sriskandarajah (IEEE Trans. Robotics Autom., 2001)

Scheduling with general job-dependent learning curves. - Gur Mosheiov; Jeffrey B. Sidney (Eur. J. Oper. Res., 2003)

Note on scheduling with general learning curves to minimize the number of tardy jobs. - Gur Mosheiov; Jeffrey B. Sidney (J. Oper. Res. Soc., 2005)

The Browne-Yechiali single-machine sequence is optimal for flow-shops. - Gur Mosheiov; Assaf Sarig; Jeffrey B. Sidney (Comput. Oper. Res., 2010)

Scheduling a deteriorating maintenance activity on a single machine. - Gur Mosheiov; Jeffrey B. Sidney (J. Oper. Res. Soc., 2010)

Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs. - Inna G. Drobouchevitch; Jeffrey B. Sidney (Comput. Oper. Res., 2012)