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

Akposeiyifa J. Ebufegha and Simon Li

Journal of the Operational Research Society, 2022, vol. 73, issue 7, 1549-1561

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.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2021.1923376 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:73:y:2022:i:7:p:1549-1561

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2021.1923376

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().