A branch-and-bound algorithm for scheduling of new product development projects

International Transactions in Operational Research

Volumn 20, Issue 2, 2013, Pages 251-266

  Ranjbar, Mohammad ^a  

^a FERDOWSI UNIVERSITY OF MASHHAD   (Iran)

Author keywords

Branch and bound algorithm; New product development; Project scheduling

Indexed keywords

ALTERNATIVE TECHNOLOGIES; BRANCH-AND-BOUND ALGORITHMS; NET PRESENT VALUE; NEW PRODUCT DEVELOPMENT; PROJECT SCHEDULING; RESEARCH AND DEVELOPMENT PROJECTS; SCHEDULING PROBLEM; SEARCH PROCEDURES; SOLUTION PROCEDURE; TECHNICAL RISKS; TEST INSTANCES;

ALGORITHMS; BRANCH AND BOUND METHOD; PRODUCT DEVELOPMENT; TECHNOLOGY;

SCHEDULING;

EID: 84873854420     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2012.00873.x     Document Type: Article

References (16)

1. Bartusch, M., Möhring, R.H., Radermacher, F.J., 1988. Scheduling project networks with resource constraints and time windows. Annals of Operations Research 16, 201-240.
2. Chiu, S.Y., Cox Jr., L.A., Sun, X., 1999. Optimal sequential inspections of reliability systems subject to parallel-chain precedence constraints. Discrete Applied Mathematics 96-97, 327-336.
3. Cohen, M.A., Eliashberg, J., Ho, T.H., 1996. New product development: the performance and time-to-market tradeoff. Management Science 42, 17-186.
4. Coolen, K., Wei, W., Talla Nobibon, F., Leus, R., 2012. Project scheduling with modular project completion on a bottleneck resource. In Proceedings of 13th International Conference on Project Management and Scheduling, Leuven, Belgium, April 1-4, 2012, pp. 125-128.
5. Creemers, S., De Reyck, B., Lambrecht, M., Leus, R., 2009. Project scheduling with alternative technologies and stochastic activity durations. In Proceedings of Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2009), Dublin, Ireland, August 10-12, 2009, pp. 756-760.
6. De Reyck, B., Leus, R., 2008. R&D-project scheduling when activities may fail. IIE Transaction 40, 367-384.
7. De Reyck, B., Grushka-Cockayne, Y., Leus, R., 2007. A new challenge in project scheduling: the incorporation of alternative failures. Tijdschrift voor Economie en Management, LII, 411-434.
8. Demeulemeester, E., Herroelen, W., 2002. Project Scheduling-A Research Handbook. Kluwer Academic Publishers, Boston, MA.
9. Demeulemeester, E., Vanhoucke, M., Herroelen, W., 2003. A random generator for activity-on-the-node networks. Journal of Scheduling 6, 13-34.
10. Elmaghraby, S., Kamburowski, J., 1992. The analysis of activity networks under generalized precedence relations (GPRs). Management Science 38, 1245-1263.
11. Hendricks, K.B., Singhal, V.R., 2008. The effect of product introduction delays on operating performance. Management Science 54(5), 878-892.
12. Lawler, E.L., 1976. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York.
13. Mastor, A.A., 1970. An experimental investigation and comparative evaluation of production line balancing techniques. Management Science 16, 11, 728-746.
14. Monma, C.L., Sidney, J.B., 1979. Sequencing with series-parallel precedence constraints. Mathematics of Operations Research 4, 215-224.
15. Price, H.W., 1959. Least-cost testing sequence. Journal of Industrial Engineering, 10, 278-279.
16. Vanhoucke, M., 2006. An efficient hybrid search procedure for various optimization problems. Lecture Notes in Computer Science 3906, 272-283.