Chrissoleon T. Papadopoulos
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Chrissoleon T. Papadopoulos has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
- Diomidis Spinellis
Athens University of Economics and Business
11 shared publications - Michael E. J. O’kelly
National University of Ireland University College Galway
7 shared publications - Michael J. Vidalis
University of the Aegean
7 shared publications - Alexandros Diamantidis
Department of Economics, Aristotle University of Thessaloniki, 54124 Thessaloniki, Greece
5 shared publications - George Liberopoulos
Department of Mechanical Engineering, University of Thessaly, Volos, Greece
4 shared publications Jingshan Li
Department of Industrial and Systems Engineering, University of Wisconsin, Madison, WI 53706, USA
3 shared publications
Latest Publications
- Open Access
- 14 July 2025
- Published by Frontiers Media SA in Frontiers in Manufacturing Technology
- Vol. 5, 1439421
Extraction of exact symbolic stationary probability formulas for Markov chains with finite space with application to production lines. Part I: description of methodology
Introduction: Markov chains are a powerful tool for modeling systems in various scientific domains, including queueing theory. These models are characterized by their ability to maintain complexity at a low level due to a property known as the Markov property, which enables the connection between states and transition probabilities. The transition matrices of Markov chains are represented by graphs, which show the properties and characteristics that help analyze the underlying processes.Method: The graph representing the transition matrix of a Markov chain is formed from the transition state diagram, with weights representing the mean transition rates. A probability space is thus created, containing all the spanning trees of the graph that end up in the states of the Markov chain (anti-arborescences). A successive examination of the graph’s vertices is initiated to form monomials as products of the weights of the edges forming the symbolic solution.Results: A general algorithm that commences with the Markov chain transition matrix as an input element and forms the state transition diagram. Subsequently, each vertex within the graph is examined, followed by a rearrangement of the vertices according to a depth-first search strategy. In the context of an inverted graph, implementing a suitable algorithm for forming spanning trees, such as the Gabow and Myers algorithm, is imperative. This algorithm is applied sequentially, resulting in the formation of monomials, polynomials for each vertex, and, ultimately, the set of polynomials of the graph. Utilizing these polynomials facilitates the calculation of the stationary probabilities of the Markov chain and the performance metrics.Discussion: The proposed method provides a positive response to the inquiry regarding the feasibility of expressing the performance metrics of a system modeled by a Markov chain through closed-form equations. The study further posits that these specific equations are of considerable magnitude. The intricacy of their formulation enables their implementation in smaller systems, which can serve as building blocks for other methodologies. The correlation between Markov chains and graphs has the potential to catalyze novel research directions in both discrete mathematics and artificial intelligence.
- 14 July 2025
- Published by Frontiers Media SA in Frontiers in Manufacturing Technology
- Vol. 5, 1439421
Open AccessExtraction of exact symbolic stationary probability formulas for Markov chains with finite space with application to production lines. Part I: description of methodology
Introduction: Markov chains are a powerful tool for modeling systems in various scientific domains, including queueing theory. These models are characterized by their ability to maintain complexity at a low level due to a property known as the Markov property, which enables the connection between states and transition probabilities. The transition matrices of Markov chains are represented by graphs, which show the properties and characteristics that help analyze the underlying processes.Method: The graph representing the transition matrix of a Markov chain is formed from the transition state diagram, with weights representing the mean transition rates. A probability space is thus created, containing all the spanning trees of the graph that end up in the states of the Markov chain (anti-arborescences). A successive examination of the graph’s vertices is initiated to form monomials as products of the weights of the edges forming the symbolic solution.Results: A general algorithm that commences with the Markov chain transition matrix as an input element and forms the state transition diagram. Subsequently, each vertex within the graph is examined, followed by a rearrangement of the vertices according to a depth-first search strategy. In the context of an inverted graph, implementing a suitable algorithm for forming spanning trees, such as the Gabow and Myers algorithm, is imperative. This algorithm is applied sequentially, resulting in the formation of monomials, polynomials for each vertex, and, ultimately, the set of polynomials of the graph. Utilizing these polynomials facilitates the calculation of the stationary probabilities of the Markov chain and the performance metrics.Discussion: The proposed method provides a positive response to the inquiry regarding the feasibility of expressing the performance metrics of a system modeled by a Markov chain through closed-form equations. The study further posits that these specific equations are of considerable magnitude. The intricacy of their formulation enables their implementation in smaller systems, which can serve as building blocks for other methodologies. The correlation between Markov chains and graphs has the potential to catalyze novel research directions in both discrete mathematics and artificial intelligence.
- Open Access
- 14 July 2025
- Published by Frontiers Media SA in Frontiers in Manufacturing Technology
- Vol. 5, 1439429
Extraction of exact symbolic stationary probability formulas for Markov chains in finite space with application to production lines. part II: unveiling accurate formulas for very short serial production lines without buffers (three- and four-stations)
Introduction: Over the past seven decades, a significant volume of research has been dedicated to manufacturing systems due to their importance in the worldwide economy. Much of this research has focused on using Markov stochastic modeling to formulate manufacturing systems problems. During the research effort, numerous numerical methods have been developed for solving such systems; however, relatively few formulas have been proposed. That is because even small systems are characterized by the well-known state explosion problem.Methods: In short serial production lines, the underlying Markov chain is depicted as a graph of the transition diagram, which is constructed by implementing an algorithm. The steady-state probabilities are extracted in the symbolic form of two polynomial ratios. That is accomplished by employing a recently introduced method that assigns probabilities in symbolic form on the graph anti-arborescences. Finally, the performance metrics of the short production line can be obtained in exact closed-form expressions via its known definition from extant literature using straightforward algebraic operations.Results: The closed-form formulae for the performance metrics of short serial production lines (e.g., throughput, maximum utilization, work in process, blocking probability for the second station, probability of the third station being idle, etc.) with two, three, and four stages, absent buffers, are presented herein for the first time in the extant literature. The proposed algorithm results shed light on the well-known phenomenon of production lines known as the “bowl phenomenon”. Comprehending the formula structure enables the formulation of a straightforward model for throughput estimation for fully balanced short serial production lines using genetic programming for lines up to thirteen stages.Discussion: The enormous size of the exact formulas highlights the need for more computational support for production lines larger than four stages without buffers. A comprehensive understanding of the underlying principles governing exact formulas will facilitate the implementation of innovative mathematical approaches to problem-solving. This understanding will also enable artificial intelligence to derive precise mathematical relationships with reduced complexity, thereby fostering intuition in production lines.
- 14 July 2025
- Published by Frontiers Media SA in Frontiers in Manufacturing Technology
- Vol. 5, 1439429
Open AccessExtraction of exact symbolic stationary probability formulas for Markov chains in finite space with application to production lines. part II: unveiling accurate formulas for very short serial production lines without buffers (three- and four-stations)
Introduction: Over the past seven decades, a significant volume of research has been dedicated to manufacturing systems due to their importance in the worldwide economy. Much of this research has focused on using Markov stochastic modeling to formulate manufacturing systems problems. During the research effort, numerous numerical methods have been developed for solving such systems; however, relatively few formulas have been proposed. That is because even small systems are characterized by the well-known state explosion problem.Methods: In short serial production lines, the underlying Markov chain is depicted as a graph of the transition diagram, which is constructed by implementing an algorithm. The steady-state probabilities are extracted in the symbolic form of two polynomial ratios. That is accomplished by employing a recently introduced method that assigns probabilities in symbolic form on the graph anti-arborescences. Finally, the performance metrics of the short production line can be obtained in exact closed-form expressions via its known definition from extant literature using straightforward algebraic operations.Results: The closed-form formulae for the performance metrics of short serial production lines (e.g., throughput, maximum utilization, work in process, blocking probability for the second station, probability of the third station being idle, etc.) with two, three, and four stages, absent buffers, are presented herein for the first time in the extant literature. The proposed algorithm results shed light on the well-known phenomenon of production lines known as the “bowl phenomenon”. Comprehending the formula structure enables the formulation of a straightforward model for throughput estimation for fully balanced short serial production lines using genetic programming for lines up to thirteen stages.Discussion: The enormous size of the exact formulas highlights the need for more computational support for production lines larger than four stages without buffers. A comprehensive understanding of the underlying principles governing exact formulas will facilitate the implementation of innovative mathematical approaches to problem-solving. This understanding will also enable artificial intelligence to derive precise mathematical relationships with reduced complexity, thereby fostering intuition in production lines.
- 7 February 2023
- Published by Springer Nature
- p. 175-198
Neural Networks Based Throughput Estimation of Short Production Lines Without Intermediate Buffers
- 7 February 2023
- Published by Springer Nature
- p. 175-198
Neural Networks Based Throughput Estimation of Short Production Lines Without Intermediate Buffers
- 23 October 2021
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 34 (2) , 823-852
A hybrid evolutionary algorithm approach for estimating the throughput of short reliable approximately balanced production lines
- 23 October 2021
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 34 (2) , 823-852
A hybrid evolutionary algorithm approach for estimating the throughput of short reliable approximately balanced production lines
- 2 July 2019
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 58 (13) , 3881-3904
Performance evaluation of flow lines with non-identical and unreliable parallel machines and finite buffers
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.
- 2 July 2019
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 58 (13) , 3881-3904
Performance evaluation of flow lines with non-identical and unreliable parallel machines and finite buffers
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.
- Top Cited Papers
- 1 February 2019
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 128, 219-244
A classification and review of timed Markov models of manufacturing systems
- 1 February 2019
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 128, 219-244
Top Cited PapersA classification and review of timed Markov models of manufacturing systems
- 1 January 2018
- Published by Elsevier in Journal of Manufacturing Systems
- Vol. 46, 208-220
Analysis, design, and control of Bernoulli production lines with waiting time constraints
- 1 January 2018
- Published by Elsevier in Journal of Manufacturing Systems
- Vol. 46, 208-220
Analysis, design, and control of Bernoulli production lines with waiting time constraints
- 1 February 2016
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (21) , 6281-6284
Continuous improvement in manufacturing and service systems
Due to strong competitions in modern manufacturing and service, continuous improvement becomes more and more critical, which is the foundation for any manufacturing and service organisation to sust...
- 1 February 2016
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (21) , 6281-6284
Continuous improvement in manufacturing and service systems
Due to strong competitions in modern manufacturing and service, continuous improvement becomes more and more critical, which is the foundation for any manufacturing and service organisation to sust...
- 1 February 2016
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (21) , 6436-6457
A design model and a production–distribution and inventory planning model in multi-product supply chain networks
Supply chain network (SCN) design implicates decision-making at a strategic level. That includes selecting the right suppliers and determining the number and the location of plants, distribution centres and retailers. An apt design model of the supply chain is imperative for the proper function of the supply chain and consequently for making better operational decisions in an attempt of a continuous improvement. In this paper, we propose two models. The first model is a mixed-integer linear programming model which is concerned with the SCN design problem, whereas the second operational model is a mixed-integer non-linear programming model in respect to the production–distribution and inventory planning problem in a supply chain network. The number of customers and suppliers as well as their demand and capacities are assumed to be known in both models. Two steady-state genetic algorithms were implemented in MATLAB in order to solve both the design and the operational model. The results were compared with GAMS. Some examples were devised in order to demonstrate potential ways of use for the designer of the supply chain network, as well as for the supply chain manager.
- 1 February 2016
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (21) , 6436-6457
A design model and a production–distribution and inventory planning model in multi-product supply chain networks
Supply chain network (SCN) design implicates decision-making at a strategic level. That includes selecting the right suppliers and determining the number and the location of plants, distribution centres and retailers. An apt design model of the supply chain is imperative for the proper function of the supply chain and consequently for making better operational decisions in an attempt of a continuous improvement. In this paper, we propose two models. The first model is a mixed-integer linear programming model which is concerned with the SCN design problem, whereas the second operational model is a mixed-integer non-linear programming model in respect to the production–distribution and inventory planning problem in a supply chain network. The number of customers and suppliers as well as their demand and capacities are assumed to be known in both models. Two steady-state genetic algorithms were implemented in MATLAB in order to solve both the design and the operational model. The results were compared with GAMS. Some examples were devised in order to demonstrate potential ways of use for the designer of the supply chain network, as well as for the supply chain manager.
- 17 April 2015
- Published by Springer Nature in Annals of Operations Research
- Vol. 231 (1) , 1-3
Advances in stochastic models of manufacturing and service operations
- 17 April 2015
- Published by Springer Nature in Annals of Operations Research
- Vol. 231 (1) , 1-3
Advances in stochastic models of manufacturing and service operations