A branch‐and‐bound algorithm for scheduling of new product development projects. (17th October 2012)

• Record Type: Journal Article
• Authors: Ranjbar, Mohammad
• Is Part Of: International transactions in operational research. Volume 20:Number 2(2013:Mar.)
• Page Start: 251
• Page End: 266
• Publication Date: 2012-10-17
• Subjects: Operations research -- Periodicals; 003
• DOI: 10.1111/j.1475-3995.2012.00873.x
• Languages: English
• ISSNs: 0969-6016

Abstract

<abstract abstract-type="main"> <title>Abstract</title> <p>In this paper, we consider scheduling problem in a new product development project. Each research and development project consists of a set of activities in which each activity may be executed in several ways. Each way of execution of an activity is a different technology, called an alternative technology, which may fail due to technical risks. In this work, we focus on alternative technologies for scheduling activities to maximize the expected net present value. We assume that the activity payoff is obtained as soon as any single technology is completed successfully. Therefore, we analyze the problem and develop a two‐phase solution procedure, consisting of a branch‐and‐bound algorithm and a recursive search procedure. The efficiency of the proposed algorithm has been evaluated on a set of randomly generated test instances.</p> </abstract>