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

DOI10.1111/j.1475-3995.2012.00873.xzbMath1263.90034OpenAlexW2090317858MaRDI QIDQ4921224

No author found.

Publication date: 23 May 2013

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2012.00873.x

zbMATH Keywords

branch-and-bound algorithmproject schedulingnew product development

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Project scheduling under the threat of catastrophic disruption ⋮ Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry ⋮ A Genetic Algorithm for Scheduling Alternative Tasks Subject to Technical Failure

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling modular projects on a bottleneck resource
• Optimal sequential inspections of reliability systems subject to parallel-chain precedence constraints
• Rangen: A random network generator for activity-on-the-node networks
• Sequencing with Series-Parallel Precedence Constraints
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• New Product Development: The Performance and Time-to-Market Tradeoff
• An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques

This page was built for publication: A branch‐and‐bound algorithm for scheduling of new product development projects