2015International Journal of Modern Education and Computer ScienceOpen access

Comparison of Requirement Prioritization Techniques to Find Best Prioritization Technique

Javed Ali Khan, Izaz Ur Rehman, Yawar Hayat Khan, Iftikhar Javed Khan, Salman Rashid

Open full text 68 citations

Abstract

This paper describes an assessment of different requirement prioritization techniques (binary search tree, AHP, hierarchy AHP, spanning tree matrix, priority group/Numerical Analysis, bubble sort, MoSoW, simple ranking and Planning Game) on the basis of previous literature.Five research papers and thesis are critically reviewed, in order to select best requirement prioritization method.The study of literature shows that AHP is the best requirements prioritization technique amongst all the requirements prioritization techniques.It provides the most efficient and reliable results which are on ratio scale.It is fault-tolerant and provides a consistency check.

Open-access reader

About this research paper

What this paper is about

This paper describes an assessment of different requirement prioritization techniques (binary search tree, AHP, hierarchy AHP, spanning tree matrix, priority group/Numerical Analysis, bubble sort, MoSoW, simple ranking and Planning Game) on the basis of previous literature.Five research papers and thesis are critically reviewed, in order to select best requirement prioritization method.The study of literature shows that AHP is the best requirements prioritization technique amongst all the requirements prioritization techniques.It provides the most efficient and reliable results which are on ratio scale.It is fault-tolerant and provides a consistency check.

Why it matters

OpenAlex reports 68 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper describes an assessment of different requirement prioritization techniques (binary search tree, AHP, hierarchy AHP, spanning tree matrix, priority group/Numerical Analysis, bubble sort, MoSoW, simple ranking and Planning Game) on the basis of previous literature.Five research papers and thesis are critically reviewed, in order to select best requirement prioritization method.The study of literature shows that AHP is the best requirements prioritization technique amongst all the requirements prioritization techniques.It provides the most efficient and reliable results which are on ratio scale.It is fault-tolerant and provides a consistency check.

Key concepts: Computer science, Prioritization, Analytic hierarchy process, Ranking (information retrieval), Requirement prioritization, Consistency (knowledge bases), Hierarchy, Operations research

Related papers

Back to paper searchBrowse research topicsOriginal source
Comparison of Requirement Prioritization Techniques to Find Best Prioritization Technique — Research Paper | ScholarLens