J-GLOBAL         Last updated: May 30, 2019 at 17:40
Tokyo Metropolitan University
Job title
PH.D(Sophia University)
Research funding number

Research Areas



Graduate School, Division of Engineering, Sophia University
Faculty of Engineering, Sophia University

Published Papers

Numerical Approach for a Discrete Markov Model for Progressing Drug Resistance of Cancer
M.Maeda, H.Yamashita
PLoS Computational Biology   15(2) e1006770   2019   [Refereed]
T.Watanabe, H.Yamashita
J. of Operations Research Society of Japan   60 201-2214   2017   [Refereed]
T.Irohara, Y.Ishizuka, H.Yamashita
J. of Japan Industrial Management Association   57 87-96   2007   [Refereed]
H.Yamashita, Y.Ishizuka and S.Suzuki
Mathematical Programming   108(2/3) 419-433   2006   [Refereed]
Analysis of dispatching rules of AGV systems with multiple vehicles
IIE Transactions   30 883-891   1998   [Refereed]
H.Yamashita, H.Ohtani, S.Suzuki
J. of Operations Research Society of Japan   41 492-508   1998   [Refereed]
Geometric product form queueing networks with concurrent batch movements
H.Yamashita, M.Miyazawa
Advanced Applied Probability   30 1111-1129   1998   [Refereed]
D.Park, H.G.Perros, H.Yamashita
Operations Research Letters   15 95-104   1994   [Refereed]
Allocation of buffer capacities in queueing networks with arbitrary topologies
H.Yamashita, R.O.Onvural
Annals of Operations Research   48 313-332   1994   [Refereed]
Discrete-time analysis of a classified multi-server queue with burst arrivals and a shared buffer
Queueing Systems   18 167-182   1994   [Refereed]


Performance modelling of a shared buffer ATM switch architecture
Teletraffic and Datatraffic in a Period of Change   14    1992
An Approximation Method for Queuing Network With a Common Buffer and Blocking
Lecture Notes in Control and Information Sciences   143    1990
JSME International Journal   32(3)    1989
The Modeling and Analysis of a Production Line Operated According to Demands
54(502)    1988
An Approximate Solution Method for Optimal Buffer Allocation in serial n-stage Automatic Production Lines
53(487)    1987
Evaluation Methods for Line Configuration of Automatic Production Lines
5(2)    1986
A Discrete-time Queueing Model of the Shared Buffer ATM Switch with Bursty Arrivals
Telecommunication Systems   2(1) 1-20   1993
Discrete-time analysis of a classified multi-server queue with burst arrivals and a shared buffer
Queueing Systems   18 167-182   1994
Annals of Operations Research   49 101-110   1994
Buffer allocation problem for feed-forward open queveing networks(共同)
Annals of Operations Research   48 313-332   1995
Queueing Models of Manufacturing Systems
9 35-45   1999
Geometric product form gueueing networks with concurrent batch movements
Advanced Applied Probability   30 1-19   1998
Journal of Operations Research Society of Japan   41 492-508   1998
Journal of Operations Research Society of Japan   41 442-454   1998
IIE Transactions   Vol.33, pp.889-895    2001

Books etc

On the cell loss distribution of protocal data units in ATM networks
High Speed Networks and their Performance (North-Holland)   1994   
Discrete-time analysis of a finite capacity queue with an 'all or nothing policy' to reduce burst loss (共同)
Data Communications and their Performance   1995   
Queueing Theory
Hand books in Operations Research and Management Science   1995   
Delay and Overflow of Discrete-time Priority Qveve with Burst Arrivals and Partial Buffer Sharing
Performance and Management of Complex Communication Networks   1998   

Research Grants & Projects

Stochastic Modeling and Analysis of Manufacturing Sysytems, Communication Sysytems, and Service Sysytems