Jeffrey B. Sidney

Publication Activity (10 Years)

Years Active: 1975-2012
Publications (10 Years): 0

Top Topics

Dynamic Programming

Parallel Machines

Top Venues

Comput. Oper. Res.

Publications

Inna G. Drobouchevitch, Jeffrey B. Sidney
Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs. Comput. Oper. Res. 39 (9) (2012)
Gur Mosheiov, Assaf Sarig, Jeffrey B. Sidney
The Browne-Yechiali single-machine sequence is optimal for flow-shops. Comput. Oper. Res. 37 (11) (2010)
Gur Mosheiov, Jeffrey B. Sidney
Scheduling a deteriorating maintenance activity on a single machine. J. Oper. Res. Soc. 61 (5) (2010)
Gur Mosheiov, Jeffrey B. Sidney
Note on scheduling with general learning curves to minimize the number of tardy jobs. J. Oper. Res. Soc. 56 (1) (2005)
Gur Mosheiov, Jeffrey B. Sidney
Scheduling with general job-dependent learning curves. Eur. J. Oper. Res. 147 (3) (2003)
Suresh P. Sethi, Jeffrey B. Sidney, Chelliah Sriskandarajah
Scheduling in dual gripper robotic cells for productivity gains. IEEE Trans. Robotics Autom. 17 (3) (2001)
Jeffrey B. Sidney, Chris N. Potts, Chelliah Sriskandarajah
A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups. Oper. Res. Lett. 26 (4) (2000)
Nicholas G. Hall, Wei-Ping Liu, Jeffrey B. Sidney
Scheduling in broadcast networks. Networks 32 (4) (1998)
Wei-Ping Liu, Jeffrey B. Sidney, André van Vliet
Ordinal algorithms for parallel machine scheduling. Oper. Res. Lett. 18 (5) (1996)
Wei-Ping Liu, Jeffrey B. Sidney
Bin packing using semi-ordinal data. Oper. Res. Lett. 19 (3) (1996)
Daniel E. Lane, Jeffrey B. Sidney
Batching and Scheduling in FMS Hubs: Flow Time Considerations. Oper. Res. 41 (6) (1993)
Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney
A Distributed Selection Algorithm and its Expected Communication Complexity. Theor. Comput. Sci. 100 (1) (1992)
Jeffrey B. Sidney, Stuart J. Sidney, A. Warburton
Average properties of two-dimensional partial orders. Networks 21 (5) (1991)
Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia
Geometric Containment and Partial Orders. SIAM J. Discret. Math. 2 (2) (1989)
Nicola Santoro, Michael Scheutzow, Jeffrey B. Sidney
On the Expected Complexity of Distributed Selection. J. Parallel Distributed Comput. 5 (2) (1988)
Clyde L. Monma, Jeffrey B. Sidney
Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions. Math. Oper. Res. 12 (1) (1987)
Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia
Geometric Containment and Vector Dominance. Theor. Comput. Sci. 53 (1987)
Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney
On the Expected Complexity of Distributed Selection. STACS (1987)
Jeffrey B. Sidney, George Steiner
Optimal Sequencing by Modular Decomposition: Polynomial Algorithms. Oper. Res. 34 (4) (1986)
Doron Rotem, Nicola Santoro, Jeffrey B. Sidney
Shout echo selection in distributed files. Networks 16 (1) (1986)
Doron Rotem, Nicola Santoro, Jeffrey B. Sidney
Distributed Sorting. IEEE Trans. Computers 34 (4) (1985)
Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia
Geometric Containment is not Reducible to Pareto Dominance. STACS (1985)
Nicola Santoro, Jeffrey B. Sidney
Interpolation-Binary Search. Inf. Process. Lett. 20 (4) (1985)
Jeffrey B. Sidney
Sequencing and scheduling-an introduction to the mathematics of the job-shop, by Simon French, Wiley, 1982, 245 pp. Price: $49.95. Networks 13 (2) (1983)
Jeffrey B. Sidney
A Decomposition Algorithm for Sequencing with General Precedence Constraints. Math. Oper. Res. 6 (2) (1981)
Jeffrey B. Sidney
The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations. Oper. Res. 27 (4) (1979)
Clyde L. Monma, Jeffrey B. Sidney
Sequencing with Series-Parallel Precedence Constraints. Math. Oper. Res. 4 (3) (1979)
Jeffrey B. Sidney
Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties. Oper. Res. 25 (1) (1977)
Jeffrey B. Sidney
Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs. Oper. Res. 23 (2) (1975)