Deterministic model of throughput in a (single tread) production lineOperational Research. (Ressource Management)What is the Deterministic Traffic Generation Model?Is there a Little law for a network of two connected queues?optimizing contractor schedules - operations research linear programmingModel linearly: Determine amount of units for productionAlgorithm for partitioning works to workersHow do I minimize a queue with two servers, or can I?Little's Law, Queueing Theory, and the Universal Scalability LawQueuing system - advice needed on what models to use, and suitable free simulation softwareHow to model this constraint linearly?

How did the USSR manage to innovate in an environment characterized by government censorship and high bureaucracy?

In Japanese, what’s the difference between “Tonari ni” (となりに) and “Tsugi” (つぎ)? When would you use one over the other?

Is it important to consider tone, melody, and musical form while writing a song?

Why don't electron-positron collisions release infinite energy?

Is this a crack on the carbon frame?

Is it legal for company to use my work email to pretend I still work there?

TGV timetables / schedules?

How much RAM could one put in a typical 80386 setup?

Accidentally leaked the solution to an assignment, what to do now? (I'm the prof)

LaTeX closing $ signs makes cursor jump

What would happen to a modern skyscraper if it rains micro blackholes?

What is the offset in a seaplane's hull?

Why are electrically insulating heatsinks so rare? Is it just cost?

Which models of the Boeing 737 are still in production?

Why are 150k or 200k jobs considered good when there are 300k+ births a month?

Writing rule stating superpower from different root cause is bad writing

Collect Fourier series terms

Has the BBC provided arguments for saying Brexit being cancelled is unlikely?

Email Account under attack (really) - anything I can do?

The use of multiple foreign keys on same column in SQL Server

Arthur Somervell: 1000 Exercises - Meaning of this notation

Languages that we cannot (dis)prove to be Context-Free

Fencing style for blades that can attack from a distance

Why did Neo believe he could trust the machine when he asked for peace?



Deterministic model of throughput in a (single tread) production line


Operational Research. (Ressource Management)What is the Deterministic Traffic Generation Model?Is there a Little law for a network of two connected queues?optimizing contractor schedules - operations research linear programmingModel linearly: Determine amount of units for productionAlgorithm for partitioning works to workersHow do I minimize a queue with two servers, or can I?Little's Law, Queueing Theory, and the Universal Scalability LawQueuing system - advice needed on what models to use, and suitable free simulation softwareHow to model this constraint linearly?













0












$begingroup$


I am looking for a simple and canonical model of throughput (number of batches per unit of time) of a sequential and deterministic production line. For this simple model, I am searching for theorems relating throughput to the throughput of the slowest step and lead time (time to transform inputs into the final product).



The production line (P) is sequential and single threaded, comprises S steps. Each step, s, comprises a throughput per worker and a number of workers. The throughput per worker in each step is deterministic.



Is there a canonical model for this?



I found references for Jackson networks in this Operations Research textbook, such as this, but these seem much more complex and flexible than I am looking for (every node can connect to any other node, the productivity of each step is stochastic). I suppose this is related to work on queues, but I was neve exposed to such theories.



This is for a research project. Any references will be appreciated.










share|cite|improve this question









$endgroup$







  • 2




    $begingroup$
    It seems rather simple, the throughput of the entire line will be the throughput of its slowest step. Every other step must slow production to match the slowest - those before to prevent the built-up of inventory, and those after because they don't receive input any faster.
    $endgroup$
    – Paul Sinclair
    Mar 30 at 0:58










  • $begingroup$
    @PaulSinclair, I agree. But is there a proof for this? Or how to go about proving this?
    $endgroup$
    – LucasMation
    Mar 31 at 7:43






  • 1




    $begingroup$
    I gave the reasoning for the proof in the comment above. Anything more is just window dressing. If the steps before run at full capacity, their output will just pile up, as it cannot be cleared any faster by the slowest step, and the steps after simply experience downtime as they wait for the slowest step to produce another output for them to work on.
    $endgroup$
    – Paul Sinclair
    Mar 31 at 17:02















0












$begingroup$


I am looking for a simple and canonical model of throughput (number of batches per unit of time) of a sequential and deterministic production line. For this simple model, I am searching for theorems relating throughput to the throughput of the slowest step and lead time (time to transform inputs into the final product).



The production line (P) is sequential and single threaded, comprises S steps. Each step, s, comprises a throughput per worker and a number of workers. The throughput per worker in each step is deterministic.



Is there a canonical model for this?



I found references for Jackson networks in this Operations Research textbook, such as this, but these seem much more complex and flexible than I am looking for (every node can connect to any other node, the productivity of each step is stochastic). I suppose this is related to work on queues, but I was neve exposed to such theories.



This is for a research project. Any references will be appreciated.










share|cite|improve this question









$endgroup$







  • 2




    $begingroup$
    It seems rather simple, the throughput of the entire line will be the throughput of its slowest step. Every other step must slow production to match the slowest - those before to prevent the built-up of inventory, and those after because they don't receive input any faster.
    $endgroup$
    – Paul Sinclair
    Mar 30 at 0:58










  • $begingroup$
    @PaulSinclair, I agree. But is there a proof for this? Or how to go about proving this?
    $endgroup$
    – LucasMation
    Mar 31 at 7:43






  • 1




    $begingroup$
    I gave the reasoning for the proof in the comment above. Anything more is just window dressing. If the steps before run at full capacity, their output will just pile up, as it cannot be cleared any faster by the slowest step, and the steps after simply experience downtime as they wait for the slowest step to produce another output for them to work on.
    $endgroup$
    – Paul Sinclair
    Mar 31 at 17:02













0












0








0





$begingroup$


I am looking for a simple and canonical model of throughput (number of batches per unit of time) of a sequential and deterministic production line. For this simple model, I am searching for theorems relating throughput to the throughput of the slowest step and lead time (time to transform inputs into the final product).



The production line (P) is sequential and single threaded, comprises S steps. Each step, s, comprises a throughput per worker and a number of workers. The throughput per worker in each step is deterministic.



Is there a canonical model for this?



I found references for Jackson networks in this Operations Research textbook, such as this, but these seem much more complex and flexible than I am looking for (every node can connect to any other node, the productivity of each step is stochastic). I suppose this is related to work on queues, but I was neve exposed to such theories.



This is for a research project. Any references will be appreciated.










share|cite|improve this question









$endgroup$




I am looking for a simple and canonical model of throughput (number of batches per unit of time) of a sequential and deterministic production line. For this simple model, I am searching for theorems relating throughput to the throughput of the slowest step and lead time (time to transform inputs into the final product).



The production line (P) is sequential and single threaded, comprises S steps. Each step, s, comprises a throughput per worker and a number of workers. The throughput per worker in each step is deterministic.



Is there a canonical model for this?



I found references for Jackson networks in this Operations Research textbook, such as this, but these seem much more complex and flexible than I am looking for (every node can connect to any other node, the productivity of each step is stochastic). I suppose this is related to work on queues, but I was neve exposed to such theories.



This is for a research project. Any references will be appreciated.







operations-research queueing-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Mar 29 at 15:40









LucasMationLucasMation

1012




1012







  • 2




    $begingroup$
    It seems rather simple, the throughput of the entire line will be the throughput of its slowest step. Every other step must slow production to match the slowest - those before to prevent the built-up of inventory, and those after because they don't receive input any faster.
    $endgroup$
    – Paul Sinclair
    Mar 30 at 0:58










  • $begingroup$
    @PaulSinclair, I agree. But is there a proof for this? Or how to go about proving this?
    $endgroup$
    – LucasMation
    Mar 31 at 7:43






  • 1




    $begingroup$
    I gave the reasoning for the proof in the comment above. Anything more is just window dressing. If the steps before run at full capacity, their output will just pile up, as it cannot be cleared any faster by the slowest step, and the steps after simply experience downtime as they wait for the slowest step to produce another output for them to work on.
    $endgroup$
    – Paul Sinclair
    Mar 31 at 17:02












  • 2




    $begingroup$
    It seems rather simple, the throughput of the entire line will be the throughput of its slowest step. Every other step must slow production to match the slowest - those before to prevent the built-up of inventory, and those after because they don't receive input any faster.
    $endgroup$
    – Paul Sinclair
    Mar 30 at 0:58










  • $begingroup$
    @PaulSinclair, I agree. But is there a proof for this? Or how to go about proving this?
    $endgroup$
    – LucasMation
    Mar 31 at 7:43






  • 1




    $begingroup$
    I gave the reasoning for the proof in the comment above. Anything more is just window dressing. If the steps before run at full capacity, their output will just pile up, as it cannot be cleared any faster by the slowest step, and the steps after simply experience downtime as they wait for the slowest step to produce another output for them to work on.
    $endgroup$
    – Paul Sinclair
    Mar 31 at 17:02







2




2




$begingroup$
It seems rather simple, the throughput of the entire line will be the throughput of its slowest step. Every other step must slow production to match the slowest - those before to prevent the built-up of inventory, and those after because they don't receive input any faster.
$endgroup$
– Paul Sinclair
Mar 30 at 0:58




$begingroup$
It seems rather simple, the throughput of the entire line will be the throughput of its slowest step. Every other step must slow production to match the slowest - those before to prevent the built-up of inventory, and those after because they don't receive input any faster.
$endgroup$
– Paul Sinclair
Mar 30 at 0:58












$begingroup$
@PaulSinclair, I agree. But is there a proof for this? Or how to go about proving this?
$endgroup$
– LucasMation
Mar 31 at 7:43




$begingroup$
@PaulSinclair, I agree. But is there a proof for this? Or how to go about proving this?
$endgroup$
– LucasMation
Mar 31 at 7:43




1




1




$begingroup$
I gave the reasoning for the proof in the comment above. Anything more is just window dressing. If the steps before run at full capacity, their output will just pile up, as it cannot be cleared any faster by the slowest step, and the steps after simply experience downtime as they wait for the slowest step to produce another output for them to work on.
$endgroup$
– Paul Sinclair
Mar 31 at 17:02




$begingroup$
I gave the reasoning for the proof in the comment above. Anything more is just window dressing. If the steps before run at full capacity, their output will just pile up, as it cannot be cleared any faster by the slowest step, and the steps after simply experience downtime as they wait for the slowest step to produce another output for them to work on.
$endgroup$
– Paul Sinclair
Mar 31 at 17:02










0






active

oldest

votes












Your Answer





StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3167270%2fdeterministic-model-of-throughput-in-a-single-tread-production-line%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes















draft saved

draft discarded
















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3167270%2fdeterministic-model-of-throughput-in-a-single-tread-production-line%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

Boston (Lincolnshire) Stedsbyld | Berne yn Boston | NavigaasjemenuBoston Borough CouncilBoston, Lincolnshire