Alexandros Diamantidis

Prof. Dr. Alexandros Diamantidis

orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2009 in European Journal of Operational Research
Verified
Journal Article
Closed access
ADAlexandros Diamantidis
Alexandros Diamantidis
PCPapadopoulos T. Chrissoleon
Papadopoulos T. Chrissoleon

1 January 2004 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
ADAlexandros Diamantidis
Alexandros Diamantidis
CPC. T. Papadopoulos
C. T. Papadopoulos
In this study, the buffer allocation problem (BAP) in homogeneous, asymptotically reliable serial production lines is considered. A known aggregation method, given by Lim, Meerkov, and Top (1990), for the performance evaluation (i.e., estimation of throughput) of this type of production lines when the buffer allocation is known, is used as an evaluative method in conjunction with a newly developed dynamic programming (DP) algorithm for the BAP. The proposed algorithm is applied to production lines where the number of machines is varying from four up to a hundred machines. The proposed algorithm is fast because it reduces the volume of computations by rejecting allocations that do not lead to maximization of the line′s throughput. Numerical results are also given for large production lines.

23 January 2007 in IIE Transactions
Verified
Journal Article
Closed access
ADAlexandros Diamantidis
Alexandros Diamantidis
CPChrissoleon T. Papadopoulos
Chrissoleon T. Papadopoulos
CHCathal Heavey
Cathal Heavey
This paper studies serial flow lines, in which each station consists of multiple identical reliable parallel machines. The parallel machines of different work stations are not necessarily identical, viz., station processing times are assumed to be exponentially distributed with non-identical mean service rates. Initially, a model consisting of two stations with multiple parallel machines and an intermediate buffer is solved analytically, by developing a recursive algorithm that generates the transition matrix for any value of the intermediate buffer capacity. This model is used as a decomposition block for solving larger lines. More specifically, the decomposition block is solved via exact Markovian analysis and then the decomposition equations and an algorithm that simultaneously solves them are derived in order to evaluate the performance measures of large production systems with multiple parallel-machine stations. Numerical results are provided for large production lines with up to 1000 workstations. These results are compared against simulation and the average percentage error is found to be very small.

2 July 2019 in International Journal of Production Research
Verified
Journal Article
Closed access
ADAlexandros Diamantidis
Alexandros Diamantidis
JLJunho Lee
Junho Lee
CPChrissoleon T. Papadopoulos
Chrissoleon T. Papadopoulos
JLJingshan Li
Jingshan Li
CHCathal Heavey
Cathal Heavey
This paper examines serial production lines with unreliable non-identical parallel machines at each workstation and intermediate buffers with finite capacities. All machines are assumed to have exponential service times, times to failure and repair times. An efficient decomposition technique is introduced for the performance evaluation of such lines. Rather than replacing each parallel-machine workstation with an equivalent single-server workstation, the main contribution of this paper is the presentation of a direct approach to derive and apply decomposition equations directly for every parallel machine at each workstation. Experimental results indicate that such a method can provide a computationally efficient algorithm to analyse large serial unreliable multi-server production lines with a good accuracy compared against simulation and other available methods.

1 August 2006 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
ADAlexandros Diamantidis
Alexandros Diamantidis
CPC.T. Papadopoulos
C.T. Papadopoulos

16 October 2015 in International Journal of Production Research
Verified
Journal Article
Closed access
ADAlexandros Diamantidis
Alexandros Diamantidis
SKS.I. Koukoumialos
S.I. Koukoumialos
MVM.I. Vidalis
M.I. Vidalis
This paper examines a push–pull merge system with external demand. Multiple reliable non-identical suppliers feed a buffer that is located immediately upstream a distribution centre (DC) with parallel identical reliable machines. The DC performs another operation on the items stored in the preceding buffer and the finished products are stored in another buffer (the finished products buffer) immediately downstream the DC. Customers arrive to the system according to a Poisson process with given intensity λ and remove a finished product from the buffer of finished products. The size of a customer demand is equal to one. Both suppliers and the identical machines at DC have exponential service rates. The considered system is modelled as a continuous-time Markov process with discrete states. An algorithm that generates the transition matrix for any value of the parameters of the system is developed and all possible transition equations are derived and solved analytically. Once the transition matrix is known the performance measures of the model under consideration can be easily evaluated.