SlideShare a Scribd company logo
1 of 10
Backlog Prioritization,
Knapsack Problem, and
 Theme Feature Maps
Using computation to aid in prioritization




             Tarun Sukhani
             March 6, 2012
Backlog Prioritization (BP)
Problem
 Backlog prioritization is one of the most
  important duties of the PO because it
  determines in what order features will be
  released.
 Despite this, the methods to prioritize stories
  or features are mostly intuitive.
 Mike Cohn recommends a “Bubble Sort”
  where items are compared to each other and
  swapped until the highest value items are on
  top.
 However, this approach does not necessarily
  yield an optimal packing for each sprint. It
  also may underestimate certain types of risk.
Enter The Knapsack Problem
(KP)          C = 25 kg  9 kg



4 kg



                        RM1400
RM1200

                         20 kg
  10 kg
              3 kg


  RM800

                         RM1500
             RM2000
Reformulate BP as KP
 Now the shopping cart becomes the
  team with certain sprint capacity C =
  <number of story points>
 Each available backlog item can be
  inserted into the sprint based on its
  size and value. We can try to
  maximize the value.
Two Approaches to BP
Minimize Risk                         Maximize Value

This is the Markowitz Model:          This is the Triage Model:

We want to obtain a decent level of
                                      We want to obtain a decent level of
return (value) for a low level of
                                      risk for a high level of return (value)
risk
This problem is solvable for a single
 team
Dynamic               Genetic Algorithm
 Programming
                                   Stochastic selection and
                                      reproduction
Divide-and-conquer

                                   Sacrifice time for space – O(n)
Sacrifice space for time – O(nC)
For multiple teams? GOOD LUCK!

 The problem is NP-hard for multiple
  teams, and if the risks vary across
  team-item assignments, which they
  probably will, then it becomes even
  harder! (GAP)
 There are pseudo-polynomial time
  approximation schemes for solving
  them nonetheless. However, that’s
  beyond the scope of this discussion.
Remember the DSL?
PROJECT 4 SomeProject
TEAM 45 0 11.25 SomeTeam
THEME User Management
 USRREG 28 3000
 USRPRO 13 1200 USRREG
 PEPALO 20 1200 USRPRO
 ROLES 13 1200 PEPALO
THEME Data Management
 COMINS 10 2000
 DREQAL 15 2000
 PATCON 15 3000
 PATSER 28 3000
 SUPCLI 25 1200 DREQAL
 EDICPC 25 800 PATCON COMINS
 EDPACS 45 1200 PATSER SUPCLI
THEME Appointment Management
 PATVIS 26 3000 COMINS USRPRO
 PATEXA 23 3000 PATCON PATVIS PATSER
 PATTRE 25 3000 PATEXA DREQAL
 PATSCH 10 800 PATVIS
THEME Order Management
 ORDINV 26 2000 EDPACS
THEME Account Management
 ACCTNG 40 1200 PATTRE ORDINV
THEME Feedback Management
 REPLOG 40 1200 PATSCH ACCTNG ROLES
THEME Quality Management
 NOFNRQ 8 2000 REPLOG EDICPC
Remember Project Trees?
Theme Feature Maps

More Related Content

What's hot

Generational Layered Canvas Mechanism for Collaborative Web Applications
Generational Layered Canvas Mechanism for Collaborative Web ApplicationsGenerational Layered Canvas Mechanism for Collaborative Web Applications
Generational Layered Canvas Mechanism for Collaborative Web Applications
kata shin
 
Lecture 17: Supervised Learning Recap
Lecture 17: Supervised Learning RecapLecture 17: Supervised Learning Recap
Lecture 17: Supervised Learning Recap
butest
 

What's hot (6)

Thesis Presentation
Thesis PresentationThesis Presentation
Thesis Presentation
 
Deep Learning for Computer Vision: Optimization (UPC 2016)
Deep Learning for Computer Vision: Optimization (UPC 2016)Deep Learning for Computer Vision: Optimization (UPC 2016)
Deep Learning for Computer Vision: Optimization (UPC 2016)
 
AI optimizing HPC simulations (presentation from 6th EULAG Workshop)
AI optimizing HPC simulations (presentation from  6th EULAG Workshop)AI optimizing HPC simulations (presentation from  6th EULAG Workshop)
AI optimizing HPC simulations (presentation from 6th EULAG Workshop)
 
Regression vs Deep Neural net vs SVM
Regression vs Deep Neural net vs SVMRegression vs Deep Neural net vs SVM
Regression vs Deep Neural net vs SVM
 
Generational Layered Canvas Mechanism for Collaborative Web Applications
Generational Layered Canvas Mechanism for Collaborative Web ApplicationsGenerational Layered Canvas Mechanism for Collaborative Web Applications
Generational Layered Canvas Mechanism for Collaborative Web Applications
 
Lecture 17: Supervised Learning Recap
Lecture 17: Supervised Learning RecapLecture 17: Supervised Learning Recap
Lecture 17: Supervised Learning Recap
 

Similar to Backlog proritization

Why Deep Learning Works: Self Regularization in Deep Neural Networks
Why Deep Learning Works: Self Regularization in Deep Neural NetworksWhy Deep Learning Works: Self Regularization in Deep Neural Networks
Why Deep Learning Works: Self Regularization in Deep Neural Networks
Charles Martin
 
Vcs slides on or 2014
Vcs slides on or 2014Vcs slides on or 2014
Vcs slides on or 2014
Shakti Ranjan
 
Tensors Are All You Need: Faster Inference with Hummingbird
Tensors Are All You Need: Faster Inference with HummingbirdTensors Are All You Need: Faster Inference with Hummingbird
Tensors Are All You Need: Faster Inference with Hummingbird
Databricks
 

Similar to Backlog proritization (20)

modeling.ppt
modeling.pptmodeling.ppt
modeling.ppt
 
Quantitative Techniques
Quantitative TechniquesQuantitative Techniques
Quantitative Techniques
 
Ms(lpgraphicalsoln.)[1]
Ms(lpgraphicalsoln.)[1]Ms(lpgraphicalsoln.)[1]
Ms(lpgraphicalsoln.)[1]
 
The caret Package: A Unified Interface for Predictive Models
The caret Package: A Unified Interface for Predictive ModelsThe caret Package: A Unified Interface for Predictive Models
The caret Package: A Unified Interface for Predictive Models
 
Cutting Edge Predictive Modeling For Classification
Cutting Edge Predictive Modeling For ClassificationCutting Edge Predictive Modeling For Classification
Cutting Edge Predictive Modeling For Classification
 
Bin packing algorithms for virtual machine placement in cloud computing: a re...
Bin packing algorithms for virtual machine placement in cloud computing: a re...Bin packing algorithms for virtual machine placement in cloud computing: a re...
Bin packing algorithms for virtual machine placement in cloud computing: a re...
 
A method for prioritization of subjects with multiple components v2
A method for prioritization of subjects with multiple components v2A method for prioritization of subjects with multiple components v2
A method for prioritization of subjects with multiple components v2
 
Why Deep Learning Works: Self Regularization in Deep Neural Networks
Why Deep Learning Works: Self Regularization in Deep Neural NetworksWhy Deep Learning Works: Self Regularization in Deep Neural Networks
Why Deep Learning Works: Self Regularization in Deep Neural Networks
 
Prespective analytics with DOcplex and pandas
Prespective analytics with DOcplex and pandasPrespective analytics with DOcplex and pandas
Prespective analytics with DOcplex and pandas
 
Towards quantum machine learning calogero zarbo - meet up
Towards quantum machine learning  calogero zarbo - meet upTowards quantum machine learning  calogero zarbo - meet up
Towards quantum machine learning calogero zarbo - meet up
 
Multi Task DPP for Basket Completion by Romain WARLOP, Fifty Five
Multi Task DPP for Basket Completion by Romain WARLOP, Fifty FiveMulti Task DPP for Basket Completion by Romain WARLOP, Fifty Five
Multi Task DPP for Basket Completion by Romain WARLOP, Fifty Five
 
Kaggle Otto Challenge: How we achieved 85th out of 3,514 and what we learnt
Kaggle Otto Challenge: How we achieved 85th out of 3,514 and what we learntKaggle Otto Challenge: How we achieved 85th out of 3,514 and what we learnt
Kaggle Otto Challenge: How we achieved 85th out of 3,514 and what we learnt
 
Vcs slides on or 2014
Vcs slides on or 2014Vcs slides on or 2014
Vcs slides on or 2014
 
News From Mahout
News From MahoutNews From Mahout
News From Mahout
 
11.1. PPT on How to crack ML Competitions all steps explained.pptx
11.1. PPT on How to crack ML Competitions all steps explained.pptx11.1. PPT on How to crack ML Competitions all steps explained.pptx
11.1. PPT on How to crack ML Competitions all steps explained.pptx
 
Recent advances on large scheduling problems in CP Optimizer
Recent advances on large scheduling problems in CP OptimizerRecent advances on large scheduling problems in CP Optimizer
Recent advances on large scheduling problems in CP Optimizer
 
NTCIR-15 www-3 kasys poster
NTCIR-15 www-3 kasys posterNTCIR-15 www-3 kasys poster
NTCIR-15 www-3 kasys poster
 
Tensors Are All You Need: Faster Inference with Hummingbird
Tensors Are All You Need: Faster Inference with HummingbirdTensors Are All You Need: Faster Inference with Hummingbird
Tensors Are All You Need: Faster Inference with Hummingbird
 
Virginia Smith, Researcher, UC Berkeley at MLconf SF 2016
Virginia Smith, Researcher, UC Berkeley at MLconf SF 2016Virginia Smith, Researcher, UC Berkeley at MLconf SF 2016
Virginia Smith, Researcher, UC Berkeley at MLconf SF 2016
 
Meetup Luglio - Operations Research.pdf
Meetup Luglio - Operations Research.pdfMeetup Luglio - Operations Research.pdf
Meetup Luglio - Operations Research.pdf
 

Recently uploaded

Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slideHistor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slide
vu2urc
 

Recently uploaded (20)

Data Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt RobisonData Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt Robison
 
Driving Behavioral Change for Information Management through Data-Driven Gree...
Driving Behavioral Change for Information Management through Data-Driven Gree...Driving Behavioral Change for Information Management through Data-Driven Gree...
Driving Behavioral Change for Information Management through Data-Driven Gree...
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
 
Breaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path MountBreaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path Mount
 
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
 
A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024
 
Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024
 
Factors to Consider When Choosing Accounts Payable Services Providers.pptx
Factors to Consider When Choosing Accounts Payable Services Providers.pptxFactors to Consider When Choosing Accounts Payable Services Providers.pptx
Factors to Consider When Choosing Accounts Payable Services Providers.pptx
 
Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slideHistor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slide
 
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
 
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsHandwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed texts
 
What Are The Drone Anti-jamming Systems Technology?
What Are The Drone Anti-jamming Systems Technology?What Are The Drone Anti-jamming Systems Technology?
What Are The Drone Anti-jamming Systems Technology?
 
Exploring the Future Potential of AI-Enabled Smartphone Processors
Exploring the Future Potential of AI-Enabled Smartphone ProcessorsExploring the Future Potential of AI-Enabled Smartphone Processors
Exploring the Future Potential of AI-Enabled Smartphone Processors
 
Scaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organizationScaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organization
 
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
 
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
 
Boost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdfBoost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdf
 
Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)
 
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
 

Backlog proritization

  • 1. Backlog Prioritization, Knapsack Problem, and Theme Feature Maps Using computation to aid in prioritization Tarun Sukhani March 6, 2012
  • 2. Backlog Prioritization (BP) Problem  Backlog prioritization is one of the most important duties of the PO because it determines in what order features will be released.  Despite this, the methods to prioritize stories or features are mostly intuitive.  Mike Cohn recommends a “Bubble Sort” where items are compared to each other and swapped until the highest value items are on top.  However, this approach does not necessarily yield an optimal packing for each sprint. It also may underestimate certain types of risk.
  • 3. Enter The Knapsack Problem (KP) C = 25 kg 9 kg 4 kg RM1400 RM1200 20 kg 10 kg 3 kg RM800 RM1500 RM2000
  • 4. Reformulate BP as KP  Now the shopping cart becomes the team with certain sprint capacity C = <number of story points>  Each available backlog item can be inserted into the sprint based on its size and value. We can try to maximize the value.
  • 5. Two Approaches to BP Minimize Risk Maximize Value This is the Markowitz Model: This is the Triage Model: We want to obtain a decent level of We want to obtain a decent level of return (value) for a low level of risk for a high level of return (value) risk
  • 6. This problem is solvable for a single team Dynamic Genetic Algorithm Programming Stochastic selection and reproduction Divide-and-conquer Sacrifice time for space – O(n) Sacrifice space for time – O(nC)
  • 7. For multiple teams? GOOD LUCK!  The problem is NP-hard for multiple teams, and if the risks vary across team-item assignments, which they probably will, then it becomes even harder! (GAP)  There are pseudo-polynomial time approximation schemes for solving them nonetheless. However, that’s beyond the scope of this discussion.
  • 8. Remember the DSL? PROJECT 4 SomeProject TEAM 45 0 11.25 SomeTeam THEME User Management USRREG 28 3000 USRPRO 13 1200 USRREG PEPALO 20 1200 USRPRO ROLES 13 1200 PEPALO THEME Data Management COMINS 10 2000 DREQAL 15 2000 PATCON 15 3000 PATSER 28 3000 SUPCLI 25 1200 DREQAL EDICPC 25 800 PATCON COMINS EDPACS 45 1200 PATSER SUPCLI THEME Appointment Management PATVIS 26 3000 COMINS USRPRO PATEXA 23 3000 PATCON PATVIS PATSER PATTRE 25 3000 PATEXA DREQAL PATSCH 10 800 PATVIS THEME Order Management ORDINV 26 2000 EDPACS THEME Account Management ACCTNG 40 1200 PATTRE ORDINV THEME Feedback Management REPLOG 40 1200 PATSCH ACCTNG ROLES THEME Quality Management NOFNRQ 8 2000 REPLOG EDICPC