Exact analysis of a discrete material three-station one-buffer merge system with unreliable machines

A. C. Diamantidis, C. T. Papadopoulos, M. I. Vidalis

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

In this paper, a model of a discrete material flow line consisting of three unreliable machines and one buffer of limited capacity is analysed. A similar system, but with continuous flow of material was examined by Helber and Mehrtens (2001) and Tan (2001). In our system it is assumed that the buffer has two immediate preceding machines, performing the same operations and one immediate succeeding machine that receives material from the buffer. For the case where the buffer reaches its own capacity, one of the two preceding machines has priority over the other to dispose its processed part into the buffer. Processing times are assumed to be deterministic and identical for all machines and are taken as the time unit. Geometrically distributed operation dependent failures at the machines are assumed. All possible transition equations for the examined model are derived and a recursive algorithm that generates the transition matrix for any value N of the storage level is developed. Once the transition matrix is known the performance measures of the model under consideration can be easily evaluated. This model may be used as a building block in a decomposition method to evaluate large production systems with split/merge operations (for example, flow lines with quality inspections and rework loops).

Original languageEnglish
Pages (from-to)651-675
Number of pages25
JournalInternational Journal of Production Research
Volume42
Issue number4
DOIs
Publication statusPublished - Feb 15 2004
Externally publishedYes

Fingerprint

Inspection
Decomposition
Buffer
Processing
Flow line
Transition matrix
Recursive algorithm
Rework
Performance measures
Material flow

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Management Science and Operations Research

Cite this

Exact analysis of a discrete material three-station one-buffer merge system with unreliable machines. / Diamantidis, A. C.; Papadopoulos, C. T.; Vidalis, M. I.

In: International Journal of Production Research, Vol. 42, No. 4, 15.02.2004, p. 651-675.

Research output: Contribution to journalArticle

@article{1a43df51f14945d9b46cc0bb55394f32,
title = "Exact analysis of a discrete material three-station one-buffer merge system with unreliable machines",
abstract = "In this paper, a model of a discrete material flow line consisting of three unreliable machines and one buffer of limited capacity is analysed. A similar system, but with continuous flow of material was examined by Helber and Mehrtens (2001) and Tan (2001). In our system it is assumed that the buffer has two immediate preceding machines, performing the same operations and one immediate succeeding machine that receives material from the buffer. For the case where the buffer reaches its own capacity, one of the two preceding machines has priority over the other to dispose its processed part into the buffer. Processing times are assumed to be deterministic and identical for all machines and are taken as the time unit. Geometrically distributed operation dependent failures at the machines are assumed. All possible transition equations for the examined model are derived and a recursive algorithm that generates the transition matrix for any value N of the storage level is developed. Once the transition matrix is known the performance measures of the model under consideration can be easily evaluated. This model may be used as a building block in a decomposition method to evaluate large production systems with split/merge operations (for example, flow lines with quality inspections and rework loops).",
author = "Diamantidis, {A. C.} and Papadopoulos, {C. T.} and Vidalis, {M. I.}",
year = "2004",
month = "2",
day = "15",
doi = "10.1080/00207540310001602838",
language = "English",
volume = "42",
pages = "651--675",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis",
number = "4",

}

TY - JOUR

T1 - Exact analysis of a discrete material three-station one-buffer merge system with unreliable machines

AU - Diamantidis, A. C.

AU - Papadopoulos, C. T.

AU - Vidalis, M. I.

PY - 2004/2/15

Y1 - 2004/2/15

N2 - In this paper, a model of a discrete material flow line consisting of three unreliable machines and one buffer of limited capacity is analysed. A similar system, but with continuous flow of material was examined by Helber and Mehrtens (2001) and Tan (2001). In our system it is assumed that the buffer has two immediate preceding machines, performing the same operations and one immediate succeeding machine that receives material from the buffer. For the case where the buffer reaches its own capacity, one of the two preceding machines has priority over the other to dispose its processed part into the buffer. Processing times are assumed to be deterministic and identical for all machines and are taken as the time unit. Geometrically distributed operation dependent failures at the machines are assumed. All possible transition equations for the examined model are derived and a recursive algorithm that generates the transition matrix for any value N of the storage level is developed. Once the transition matrix is known the performance measures of the model under consideration can be easily evaluated. This model may be used as a building block in a decomposition method to evaluate large production systems with split/merge operations (for example, flow lines with quality inspections and rework loops).

AB - In this paper, a model of a discrete material flow line consisting of three unreliable machines and one buffer of limited capacity is analysed. A similar system, but with continuous flow of material was examined by Helber and Mehrtens (2001) and Tan (2001). In our system it is assumed that the buffer has two immediate preceding machines, performing the same operations and one immediate succeeding machine that receives material from the buffer. For the case where the buffer reaches its own capacity, one of the two preceding machines has priority over the other to dispose its processed part into the buffer. Processing times are assumed to be deterministic and identical for all machines and are taken as the time unit. Geometrically distributed operation dependent failures at the machines are assumed. All possible transition equations for the examined model are derived and a recursive algorithm that generates the transition matrix for any value N of the storage level is developed. Once the transition matrix is known the performance measures of the model under consideration can be easily evaluated. This model may be used as a building block in a decomposition method to evaluate large production systems with split/merge operations (for example, flow lines with quality inspections and rework loops).

UR - http://www.scopus.com/inward/record.url?scp=1342308560&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1342308560&partnerID=8YFLogxK

U2 - 10.1080/00207540310001602838

DO - 10.1080/00207540310001602838

M3 - Article

VL - 42

SP - 651

EP - 675

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 4

ER -