• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
Queueing theory in software development - ALEBathtub 2011-06-30
 

Queueing theory in software development - ALEBathtub 2011-06-30

on

  • 1,949 views

This is the slides from the ALEBathtub....

This is the slides from the ALEBathtub.

In this session you will learn about queuing theory and Theory of Constrains. By using real world examples of different traffic situations in Stockholm, illustrations and examples from Kanban boards you will see the similarities between them. You will lean how you can apply Theory of Constrains to find the bottleneck in your development process and how you can use this to continuously improve your development process.

Statistics

Views

Total Views
1,949
Views on SlideShare
1,947
Embed Views
2

Actions

Likes
5
Downloads
54
Comments
1

1 Embed 2

http://www.linkedin.com 2

Accessibility

Categories

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel

11 of 1 previous next

  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment
  • There are two different types of bottlenecks: - Capacity contraint resource - a resource limited by capacity, like a bottle - non instantly available resource - a resource that is not available all the time

Queueing theory in software development - ALEBathtub 2011-06-30 Queueing theory in software development - ALEBathtub 2011-06-30 Presentation Transcript

  • Queueingtheoryinsoftware development
    Håkan Forss - hakan.forss@avegagroup.se - @hakanforss
  • Or
  • What can traffic inteach you about yourdevelopment process
    Håkan Forss - hakan.forss@avegagroup.se - @hakanforss
  • Little’s Law
    Work-in-Process
    Throughput
    Cycle Time =
  • Little’s Law
    12
    12 / min
    1 min =
  • Little’s Law
    6
    12 / min
    0,5 min=
  • Little’s Law
    24
    12 / min
    2 min =
  • 8 cars / min
    4 cars / min
    With less work-in-progress
    Shorter cycle time
    Faster feedback
    Makes problems visible faster
  • TheoryofConstraints
  • 5
  • Don’t allow inertia to cause a system constraint.
  • Capacity = 4
    Capacity = 6
    Capacity = 6
    Throughput = 4
    Bottlenecks
    You can never go faster than your bottleneck
  • Bottlenecks
    Throughput = 2
    You can never go faster than your bottleneck
    Do whatever you can to make your bottleneck 100% utilized
    Try your hardest to avoid problems at you bottleneck
    You can’t make up for lost capacity at you bottleneck
  • Throughput = 4
    You can never go faster than your bottleneck
    As long as capacity in front of the bottleneck is equal to or grater than the bottleneck you will go as fast as your bottleneck
    Full use of a higher capacity in front of the bottleneck will make cycle time go up
    Bottlenecks
  • Bottlenecks
    Throughput = 4
    You can never go faster than your bottleneck
    As long as capacity is equal to or grater after the bottleneck you will go as fast as your bottleneck
    Higher capacity after the bottleneck than at the bottleneck will not improve throughput
  • Non-instantavailabilityresource
    A resource that is not available all the time
  • Non-instantavailabilityresource & bottleneck
  • You can never go faster than your bottleneck
    Balance demand against throughput to keep work-in-progress low
    Low work-in-progress
    Keeps cycle time down
    Makes bottlenecks visible faster
  • Slow down to go faster
    Slowing down can stabilize the process flow
    A stable process can go faster
  • Håkan Forss
    Mail: hakan.forss@avegagroup.se
    Twitter: @hakanforss
    Blog: http://hakanforss.wordpress.com/