default search action
Gideon Weiss
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j44]Yuval Nov, Gideon Weiss
, Hanqin Zhang
Fluid Models of Parallel Service Systems Under FCFS. Oper. Res. 70(2): 1182-1218 (2022) - [j43]Gideon Weiss:
Parallel multi-type many server conjecture. Queueing Syst. Theory Appl. 100(3-4): 269-271 (2022) - 2021
- [j42]Sheldon M. Ross
Technical Note - A Stochastic Assignment Problem with Unknown Eligibility Probabilities. Oper. Res. 69(1): 266-272 (2021) - [c3]Evgeny Shindin, Michael Masin, Gideon Weiss, Alexander Zadorojniy:
Revised SCLP-simplex Algorithm with Application to Large-Scale Fluid Processing Networks. CDC 2021: 3863-3868 - 2020
- [j41]Evgeny Shindin
A simplex-type algorithm for continuous linear programs with constant coefficients. Math. Program. 180(1): 157-201 (2020) - [j40]Gideon Weiss
Directed FCFS infinite bipartite matching. Queueing Syst. Theory Appl. 96(3-4): 387-418 (2020)
2010 – 2019
- 2019
- [j39]Ivo J. B. F. Adan, Marko A. A. Boon
Design heuristic for parallel many server systems. Eur. J. Oper. Res. 273(1): 259-277 (2019) - 2018
- [j38]Ivo J. B. F. Adan, Ana Busic
Reversibility and Further Properties of FCFS Infinite Bipartite Matching. Math. Oper. Res. 43(2): 598-621 (2018) - [j37]Ivo Adan, Igor Kleiner, Rhonda Righter
FCFS parallel service systems and matching models. Perform. Evaluation 127-128: 253-272 (2018) - [j36]Dongyuan Zhan
Many-server scaling of the N-system under FCFS-ALIS. Queueing Syst. Theory Appl. 88(1-2): 27-71 (2018) - 2017
- [c2]Ivo Adan, Rhonda Righter, Gideon Weiss:
FCFS Parallel Service Systems and Matching Models. VALUETOOLS 2017: 106-112 - 2016
- [j35]Esther Frostig, Gideon Weiss:
Four proofs of Gittins' multiarmed bandit theorem. Ann. Oper. Res. 241(1-2): 127-165 (2016) - [i2]Ivo J. B. F. Adan, Marko A. A. Boon
Design Heuristic for Parallel Many Server Systems under FCFS-ALIS. CoRR abs/1603.01404 (2016) - 2015
- [j34]Evgeny Shindin
Structure of Solutions for Continuous Linear Programs with Constant Coefficients. SIAM J. Optim. 25(3): 1276-1297 (2015) - 2014
- [j33]Yongjiang Guo, Erjen Lefeber
Stability of multi-class queueing networks with infinite virtual queues. Queueing Syst. Theory Appl. 76(3): 309-342 (2014) - [j32]Evgeny Shindin
Symmetric Strong Duality for a Class of Continuous Linear Programs with Constant Coefficients. SIAM J. Optim. 24(3): 1102-1121 (2014) - 2013
- [j31]Nafna Blanghaps, Yuval Nov, Gideon Weiss:
Sojourn Time Estimation in an M/G/∞ Queue with Partial Information. J. Appl. Probab. 50(4): 1044-1056 (2013) - [j30]Ivo J. B. F. Adan, Marko A. A. Boon
Design and evaluation of overloaded service systems with skill based routing, under FCFS policies. Perform. Evaluation 70(10): 873-888 (2013) - [j29]Ivo J. B. F. Adan, Marko A. A. Boon
Queues with skill based parallel servers and a FCFS infinite matching model. SIGMETRICS Perform. Evaluation Rev. 41(3): 22-24 (2013) - 2012
- [j28]Ivo J. B. F. Adan, Gideon Weiss:
Exact FCFS Matching Rates for Two Infinite Multitype Sequences. Oper. Res. 60(2): 475-489 (2012) - [j27]Jeremy Visschers, Ivo J. B. F. Adan, Gideon Weiss:
A product form solution to a system with multi-type jobs and multi-type servers. Queueing Syst. Theory Appl. 70(3): 269-298 (2012) - 2010
- [j26]Yoni Nazarathy
Positive Harris recurrence and diffusion scale analysis of a push pull queueing network. Perform. Evaluation 67(4): 201-217 (2010) - [j25]Yoni Nazarathy
A fluid approach to large volume job shop scheduling. J. Sched. 13(5): 509-529 (2010)
2000 – 2009
- 2009
- [j24]Yoni Nazarathy
Near optimal control of queueing networks over a finite time horizon. Ann. Oper. Res. 170(1): 233-249 (2009) - [j23]Anat Kopzon, Yoni Nazarathy
A Push-Pull Network with Infinite Supply of Work. Queueing Syst. Theory Appl. 62(1-2): 75-111 (2009) - 2008
- [j22]Gideon Weiss:
A simplex based algorithm to solve separated continuous linear programs. Math. Program. 115(1): 151-198 (2008) - [j21]Yoni Nazarathy
The asymptotic variance rate of the output process of finite capacity birth-death queues. Queueing Syst. Theory Appl. 59(2): 135-156 (2008) - [j20]Jochen Mundinger, Richard R. Weber, Gideon Weiss:
Optimal scheduling of peer-to-peer file dissemination. J. Sched. 11(2): 105-120 (2008) - [c1]Yoni Nazarathy
Positive harris recurrence and diffusion scale analysis of a push pull queueing network. VALUETOOLS 2008: 66 - 2006
- [j19]Ivo J. B. F. Adan, Gideon Weiss:
Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy. Queueing Syst. Theory Appl. 54(3): 169-183 (2006) - [j18]Jochen Mundinger, Richard R. Weber, Gideon Weiss:
Analysis of peer-to-peer file dissemination amongst users of different upload capacities. SIGMETRICS Perform. Evaluation Rev. 34(2): 5-6 (2006) - [j17]Jochen Mundinger, Richard R. Weber, Gideon Weiss:
Analysis of peer-to-peer file dissemination. SIGMETRICS Perform. Evaluation Rev. 34(3): 12-14 (2006) - [i1]Jochen Mundinger, Richard R. Weber, Gideon Weiss:
Optimal Scheduling of Peer-to-Peer File Dissemination. CoRR abs/cs/0606110 (2006) - 2002
- [j16]Jim G. Dai, Gideon Weiss:
A Fluid Heuristic for Minimizing Makespan in Job Shops. Oper. Res. 50(4): 692-707 (2002) - [j15]Anat Kopzon, Gideon Weiss:
A push-pull queueing system. Oper. Res. Lett. 30(6): 351-359 (2002)
1990 – 1999
- 1999
- [j14]Gideon Weiss:
An algorithm for minimum wait drainingof two‐station fluid re‐entrant line. Ann. Oper. Res. 92: 65-86 (1999) - 1997
- [j13]Hong Chen, Offer Kella
Fluid approximations for a processor-sharing queue. Queueing Syst. Theory Appl. 27(1-2): 99-125 (1997) - 1996
- [j12]Amar Ramudhin
A Probabilistic Analysis of Two-Machine Flowshops. Oper. Res. 44(6): 899-908 (1996) - [j11]Jim G. Dai, Gideon Weiss:
Stability and Instability of Fluid Models for Reentrant Lines. Math. Oper. Res. 21(1): 115-134 (1996) - 1994
- [j10]Richard R. Weber, Gideon Weiss:
The Cafeteria Process - Tandem Queues with 0-1 Dependent Service Times and the Bowl Shape Phenomenon. Oper. Res. 42(5): 895-912 (1994) - 1992
- [j9]Gideon Weiss:
Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling. Math. Oper. Res. 17(2): 255-270 (1992) - [j8]Sid Browne, Gideon Weiss:
Dynamic priority rules when polling with multiple parallel servers. Oper. Res. Lett. 12(3): 129-137 (1992)
1980 – 1989
- 1987
- [j7]Michael L. Pinedo, Gideon Weiss:
The "Largest Variance First" Policy in Some Stochastic Scheduling Problems. Oper. Res. 35(6): 884-891 (1987) - 1986
- [j6]Gideon Weiss:
Stochastic Bounds on Distributions of Optimal Value Functions with Applications to PERT, Network Flows and Reliability. Oper. Res. 34(4): 595-605 (1986) - 1985
- [j5]Michael L. Pinedo, Gideon Weiss:
Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines. Oper. Res. 33(6): 1381-1388 (1985) - [j4]Rolf H. Möhring, Franz Josef Radermacher, Gideon Weiss:
Stochastic scheduling problems II-set strategies-. Z. Oper. Research 29(3): 65-104 (1985) - 1984
- [j3]Gideon Weiss:
Stochastic bounds on distributions of optimal value functions with applications to pert, network flows and reliability. Ann. Oper. Res. 1(1): 59-65 (1984) - [j2]Rolf H. Möhring, Franz Josef Radermacher, Gideon Weiss:
Stochastic scheduling problems I - General strategies. Z. Oper. Research 28(7): 193-260 (1984) - 1980
- [j1]Sheldon M. Ross, Mehrdad Shahshahani, Gideon Weiss:
On the Number of Component Failures in Systems Whose Component Lives are Exchangeable. Math. Oper. Res. 5(3): 358-365 (1980)
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 2024-10-30 20:34 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: