default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeffrey B. Sidney
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2012
[j27]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): 1919-1926 (2012)- 2010
- [j26]Gur Mosheiov, Assaf Sarig
, Jeffrey B. Sidney:
The Browne-Yechiali single-machine sequence is optimal for flow-shops. Comput. Oper. Res. 37(11): 1965-1967 (2010) - [j25]Gur Mosheiov, Jeffrey B. Sidney:
Scheduling a deteriorating maintenance activity on a single machine. J. Oper. Res. Soc. 61(5): 882-887 (2010) - 2005
- [j24]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): 110-112 (2005) - 2003
- [j23]Gur Mosheiov, Jeffrey B. Sidney:
Scheduling with general job-dependent learning curves. Eur. J. Oper. Res. 147(3): 665-670 (2003) - 2001
- [j22]Suresh P. Sethi, Jeffrey B. Sidney, Chelliah Sriskandarajah:
Scheduling in dual gripper robotic cells for productivity gains. IEEE Trans. Robotics Autom. 17(3): 324-341 (2001) - 2000
- [j21]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): 165-173 (2000) - 1998
- [j20]Nicholas G. Hall, Wei-Ping Liu, Jeffrey B. Sidney:
Scheduling in broadcast networks. Networks 32(4): 233-253 (1998) - 1996
- [j19]Wei-Ping Liu, Jeffrey B. Sidney, André van Vliet:
Ordinal algorithms for parallel machine scheduling. Oper. Res. Lett. 18(5): 223-232 (1996) - [j18]Wei-Ping Liu, Jeffrey B. Sidney:
Bin packing using semi-ordinal data. Oper. Res. Lett. 19(3): 101-104 (1996) - 1993
- [j17]Daniel E. Lane, Jeffrey B. Sidney:
Batching and Scheduling in FMS Hubs: Flow Time Considerations. Oper. Res. 41(6): 1091-1103 (1993) - 1992
- [j16]Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney:
A Distributed Selection Algorithm and its Expected Communication Complexity. Theor. Comput. Sci. 100(1): 185-204 (1992) - 1991
- [j15]Jeffrey B. Sidney, Stuart J. Sidney, Art Warburton:
Average properties of two-dimensional partial orders. Networks 21(5): 487-503 (1991) - 1989
- [j14]Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia:
Geometric Containment and Partial Orders. SIAM J. Discret. Math. 2(2): 245-254 (1989) - 1988
- [j13]Nicola Santoro, Michael Scheutzow, Jeffrey B. Sidney:
On the Expected Complexity of Distributed Selection. J. Parallel Distributed Comput. 5(2): 194-203 (1988) - 1987
- [j12]Clyde L. Monma, Jeffrey B. Sidney:
Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions. Math. Oper. Res. 12(1): 22-31 (1987) - [j11]Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia:
Geometric Containment and Vector Dominance. Theor. Comput. Sci. 53: 345-352 (1987) - 1986
- [j10]Jeffrey B. Sidney, George Steiner:
Optimal Sequencing by Modular Decomposition: Polynomial Algorithms. Oper. Res. 34(4): 606-612 (1986) - [j9]Doron Rotem, Nicola Santoro, Jeffrey B. Sidney:
Shout echo selection in distributed files. Networks 16(1): 77-86 (1986) - 1985
- [j8]Nicola Santoro, Jeffrey B. Sidney:
Interpolation-Binary Search. Inf. Process. Lett. 20(4): 179-181 (1985) - [j7]Doron Rotem, Nicola Santoro, Jeffrey B. Sidney:
Distributed Sorting. IEEE Trans. Computers 34(4): 372-376 (1985) - 1983
- [j6]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): 310-311 (1983) - 1981
- [j5]Jeffrey B. Sidney:
A Decomposition Algorithm for Sequencing with General Precedence Constraints. Math. Oper. Res. 6(2): 190-204 (1981) - 1979
- [j4]Jeffrey B. Sidney:
The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations. Oper. Res. 27(4): 782-791 (1979) - [j3]Clyde L. Monma, Jeffrey B. Sidney:
Sequencing with Series-Parallel Precedence Constraints. Math. Oper. Res. 4(3): 215-224 (1979) - 1977
- [j2]Jeffrey B. Sidney:
Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties. Oper. Res. 25(1): 62-69 (1977) - 1975
- [j1]Jeffrey B. Sidney:
Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs. Oper. Res. 23(2): 283-298 (1975)
Conference and Workshop Papers
- 1987
- [c2]Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney:
On the Expected Complexity of Distributed Selection. STACS 1987: 456-467 - 1985
- [c1]Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia:
Geometric Containment is not Reducible to Pareto Dominance. STACS 1985: 322-327
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 00:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
