A hybrid algorithm for task sequencing problems with iteration in product development

Abstract

Iteration is a major cause contributing to an increase in project duration and cost. By adopting the traditional models of design structure matrix and reward Markov chain, this paper proposes a hybrid algorithm for solving a task sequencing problem that aims for minimising the project duration. The proposed algorithm combines hierarchical clustering and genetic algorithms. This algorithmic strategy is intended to utilise the circuit concept to reduce the solution search space for GA. Our algorithm was compared to five other algorithms. Through numerical experiments, the proposed algorithm can solve large problems (number of tasks = 200), yield the same quality of solution results with shorter computational time, and deliver stable algorithmic performance.

Keywords:

• Product development
• task sequencing problem
• optimisation
• genetic algorithm
• cluster analysis
• design structure matrix

Disclosure statement

No potential conflict of interest was reported by the author(s).