Compression of time in manufacturing systems

Chung Chi Hsieh; Tony C. Woo

doi:10.1109/70.850642

Compression of time in manufacturing systems

Research output: Contribution to journal › Article › peer-review

Abstract

As data can be compressed, we inquire if time can also be compressed. In the context of manufacturing systems, time compression adopts such names as 'concurrency' or 'simultaneity'. While it may be intuitively appealing that scaling (halving the size of a task, for example) should be linear (halving the time), such is not quite the case, as we have discovered. We report a quantitative explanation for the nonlinear behavior of time, as a function of the size of a task and the number of agents performing the task.

Original language	English
Pages (from-to)	239-246
Number of pages	8
Journal	IEEE Transactions on Robotics and Automation
Volume	16
Issue number	3
DOIs	https://doi.org/10.1109/70.850642
Publication status	Published - 2000 Jun

All Science Journal Classification (ASJC) codes

Control and Systems Engineering
Electrical and Electronic Engineering

Access to Document

10.1109/70.850642

Cite this

@article{b30639852aaa4f719f48828e525dd1e1,

title = "Compression of time in manufacturing systems",

abstract = "As data can be compressed, we inquire if time can also be compressed. In the context of manufacturing systems, time compression adopts such names as 'concurrency' or 'simultaneity'. While it may be intuitively appealing that scaling (halving the size of a task, for example) should be linear (halving the time), such is not quite the case, as we have discovered. We report a quantitative explanation for the nonlinear behavior of time, as a function of the size of a task and the number of agents performing the task.",

author = "Hsieh, {Chung Chi} and Woo, {Tony C.}",

year = "2000",

month = jun,

doi = "10.1109/70.850642",

language = "English",

volume = "16",

pages = "239--246",

journal = "IEEE Transactions on Robotics and Automation",

issn = "1042-296X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - Compression of time in manufacturing systems

AU - Hsieh, Chung Chi

AU - Woo, Tony C.

PY - 2000/6

Y1 - 2000/6

N2 - As data can be compressed, we inquire if time can also be compressed. In the context of manufacturing systems, time compression adopts such names as 'concurrency' or 'simultaneity'. While it may be intuitively appealing that scaling (halving the size of a task, for example) should be linear (halving the time), such is not quite the case, as we have discovered. We report a quantitative explanation for the nonlinear behavior of time, as a function of the size of a task and the number of agents performing the task.

AB - As data can be compressed, we inquire if time can also be compressed. In the context of manufacturing systems, time compression adopts such names as 'concurrency' or 'simultaneity'. While it may be intuitively appealing that scaling (halving the size of a task, for example) should be linear (halving the time), such is not quite the case, as we have discovered. We report a quantitative explanation for the nonlinear behavior of time, as a function of the size of a task and the number of agents performing the task.

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

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

U2 - 10.1109/70.850642

DO - 10.1109/70.850642

M3 - Article

AN - SCOPUS:0034206934

SN - 1042-296X

VL - 16

SP - 239

EP - 246

JO - IEEE Transactions on Robotics and Automation

JF - IEEE Transactions on Robotics and Automation

IS - 3

ER -

Compression of time in manufacturing systems

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this