Jeffrey B. Sidney

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