Newshot

Optimal Development Path: An Empirical Evaluation of Tiered Dependency-Aware Sequencing

Summary

arXiv:2611.23303v1 Announce Type: new Abstract: The Optimal Development Path (ODP) in D-POAF orders Feature Blocks in a Wave Candidate by choosing the eligible block with the lowest effort-and-risk-to-value ratio (ERS/BVS), while respecting declared prerequisites. We evaluate native ODP (L0) against four dependency-aware strategies: unlock count (L1), unlocked value (L2), multi-hop potential (L3), and one-step rollout (L4), alongside local search, Sidney decomposition, and an exact reference. On held-out synthetic graphs with about one prerequisite per block, L0 attains 0.978 of the surrogate optimum at 12 blocks, versus 0.993 for L2 and 0.994 for L4. At 100 blocks, L0 attains 0.942 and L2 0.983. In contrast, 373 historical Jira sprints from 21 open-source projects in TAWOS, used as scheduling proxies rather than D-POAF Waves, contain sparse recorded dependencies. On these instances, L0 attains 0.998 of the surrogate optimum and is exactly optimal in 69% of sprints. Unlock bonuses cali…

Original text(via arXiv cs.SE)

Computer Science > Software Engineering

Title:Optimal Development Path: An Empirical Evaluation of Tiered Dependency-Aware Sequencing

Abstract:The Optimal Development Path (ODP) in D-POAF orders Feature Blocks in a Wave Candidate by choosing the eligible block with the lowest effort-and-risk-to-value ratio (ERS/BVS), while respecting declared prerequisites. We evaluate native ODP (L0) against four dependency-aware strategies: unlock count (L1), unlocked value (L2), multi-hop potential (L3), and one-step rollout (L4), alongside local search, Sidney decomposition, and an exact reference. On held-out synthetic graphs with about one prerequisite per block, L0 attains 0.978 of the surrogate optimum at 12 blocks, versus 0.993 for L2 and 0.994 for L4. At 100 blocks, L0 attains 0.942 and L2 0.983. In contrast, 373 historical Jira sprints from 21 open-source projects in TAWOS, used as scheduling proxies rather than D-POAF Waves, contain sparse recorded dependencies. On these instances, L0 attains 0.998 of the surrogate optimum and is exactly optimal in 69% of sprints. Unlock bonuses calibrated on synthetic graphs do not deliver significant average gains on these sprint-derived instances and can worsen the surrogate. L4 never worsens the declared surrogate relative to L0, but this guarantee does not extend to operational outcomes. Retrospective calendar replays using recorded Jira durations show that surrogate improvements do not reliably improve value-weighted completion. The findings support keeping L0 as the default and presenting rollout and exact references as auditable alternatives. Dependency-valid sequences expose prerequisite readiness, but their effects on interruptions, rework, costs, and delivery times remain unmeasured.
Comments:15 pages, 1 figure, 5 tables. Public aggregate benchmark results available on Zenodo: doi: https://doi.org/10.5281/zenodo.23762369
Subjects:Software Engineering (cs.SE)
Cite as:arXiv:2611.23303 [cs.SE]
(or arXiv:2611.23303v1 [cs.SE] for this version)
https://doi.org/10.48550/arXiv.2611.23303 arXiv-issued DOI via DataCite

Submission history

Access Paper:

  • HTML (experimental)

Additional Features

  • Audio Summary

Current browse context:

References & Citations

  • Google Scholar
  • Semantic Scholar

BibTeX formatted citation

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

The text above was extracted automatically from the source page and may miss images, tables or code blocks. The original is authoritative.

Published by arXiv cs.SE
This site only summarises and aggregates; copyright stays with the original author. Headlines and summaries follow the source — where they differ, the original wins.
Read the original ↗