An entropic measurement of queueing behaviour in a class of manufacturing operations

G. Frizelle, Iouri M. Soukhov

Research output: Contribution to journalArticle

57 Citations (Scopus)

Abstract

This paper is motivated by a view that there is practical value in being able to measure aspects of complexity in industrial, particularly manufacturing, systems. We address, at a decreasing level of generality, the following questions. (i) What is required from a measure that might reflect some aspects of complexity in a large dynamical system? (ii) What is the appropriate measure? (iii) How do the main characteristics of this measure show themselves in the systems of interest? (iv) Does the proposed measurement process lead to useful theoretical and practical insights? In answer to questions (i) and (ii), we suggest that in general one measures the rate of variety of behaviour the system can exhibit, and propose the Kolmogorov-Sinai (KS) entropy of the corresponding random process as a convenient measure. We then consider input-output processes as models for manufacturing systems and discuss some simple mathematical observations on how the KS entropy can be assessed in terms of random queues and a state of the server. Next, we take into account some basic features of a manufacturing process and propose formulae for its operational and structural complexity, thus answering (iii). Finally, to answer (iv), a case study is given demonstrating how the proposed measure can be used in a manufacturing plant, and we discuss practical insights for the company involved.

Original languageEnglish (US)
Pages (from-to)1579-1601
Number of pages23
JournalProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
Volume457
Issue number2011
DOIs
StatePublished - Jul 8 2001

Fingerprint

Queueing
manufacturing
Manufacturing
Entropy
Random processes
Dynamical systems
entropy
Servers
random processes
Random process
Class
dynamical systems
Queue
Server
Dynamical system
Industry
output
Output

All Science Journal Classification (ASJC) codes

  • Mathematics(all)
  • Engineering(all)
  • Physics and Astronomy(all)

Cite this

@article{ef1d641fb49c4fe7a08e82529deb5fb4,
title = "An entropic measurement of queueing behaviour in a class of manufacturing operations",
abstract = "This paper is motivated by a view that there is practical value in being able to measure aspects of complexity in industrial, particularly manufacturing, systems. We address, at a decreasing level of generality, the following questions. (i) What is required from a measure that might reflect some aspects of complexity in a large dynamical system? (ii) What is the appropriate measure? (iii) How do the main characteristics of this measure show themselves in the systems of interest? (iv) Does the proposed measurement process lead to useful theoretical and practical insights? In answer to questions (i) and (ii), we suggest that in general one measures the rate of variety of behaviour the system can exhibit, and propose the Kolmogorov-Sinai (KS) entropy of the corresponding random process as a convenient measure. We then consider input-output processes as models for manufacturing systems and discuss some simple mathematical observations on how the KS entropy can be assessed in terms of random queues and a state of the server. Next, we take into account some basic features of a manufacturing process and propose formulae for its operational and structural complexity, thus answering (iii). Finally, to answer (iv), a case study is given demonstrating how the proposed measure can be used in a manufacturing plant, and we discuss practical insights for the company involved.",
author = "G. Frizelle and Soukhov, {Iouri M.}",
year = "2001",
month = "7",
day = "8",
doi = "10.1098/rspa.2000.0731",
language = "English (US)",
volume = "457",
pages = "1579--1601",
journal = "Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences",
issn = "0080-4630",
publisher = "Royal Society of London",
number = "2011",

}

TY - JOUR

T1 - An entropic measurement of queueing behaviour in a class of manufacturing operations

AU - Frizelle, G.

AU - Soukhov, Iouri M.

PY - 2001/7/8

Y1 - 2001/7/8

N2 - This paper is motivated by a view that there is practical value in being able to measure aspects of complexity in industrial, particularly manufacturing, systems. We address, at a decreasing level of generality, the following questions. (i) What is required from a measure that might reflect some aspects of complexity in a large dynamical system? (ii) What is the appropriate measure? (iii) How do the main characteristics of this measure show themselves in the systems of interest? (iv) Does the proposed measurement process lead to useful theoretical and practical insights? In answer to questions (i) and (ii), we suggest that in general one measures the rate of variety of behaviour the system can exhibit, and propose the Kolmogorov-Sinai (KS) entropy of the corresponding random process as a convenient measure. We then consider input-output processes as models for manufacturing systems and discuss some simple mathematical observations on how the KS entropy can be assessed in terms of random queues and a state of the server. Next, we take into account some basic features of a manufacturing process and propose formulae for its operational and structural complexity, thus answering (iii). Finally, to answer (iv), a case study is given demonstrating how the proposed measure can be used in a manufacturing plant, and we discuss practical insights for the company involved.

AB - This paper is motivated by a view that there is practical value in being able to measure aspects of complexity in industrial, particularly manufacturing, systems. We address, at a decreasing level of generality, the following questions. (i) What is required from a measure that might reflect some aspects of complexity in a large dynamical system? (ii) What is the appropriate measure? (iii) How do the main characteristics of this measure show themselves in the systems of interest? (iv) Does the proposed measurement process lead to useful theoretical and practical insights? In answer to questions (i) and (ii), we suggest that in general one measures the rate of variety of behaviour the system can exhibit, and propose the Kolmogorov-Sinai (KS) entropy of the corresponding random process as a convenient measure. We then consider input-output processes as models for manufacturing systems and discuss some simple mathematical observations on how the KS entropy can be assessed in terms of random queues and a state of the server. Next, we take into account some basic features of a manufacturing process and propose formulae for its operational and structural complexity, thus answering (iii). Finally, to answer (iv), a case study is given demonstrating how the proposed measure can be used in a manufacturing plant, and we discuss practical insights for the company involved.

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

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

U2 - 10.1098/rspa.2000.0731

DO - 10.1098/rspa.2000.0731

M3 - Article

VL - 457

SP - 1579

EP - 1601

JO - Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

JF - Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

SN - 0080-4630

IS - 2011

ER -