A branch‐and‐bound algorithm for scheduling of new product development projects (Q4921224): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1111/j.1475-3995.2012.00873.x
+Normal rank
@@ Property / OpenAlex ID @@
+W2090317858
@@ Property / OpenAlex ID: W2090317858 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3468865
@@ Property / cites work: Q3468865 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal sequential inspections of reliability systems subject to parallel-chain precedence constraints
+Normal rank
@@ Property / cites work @@
+New Product Development: The Performance and Time-to-Market Tradeoff
+Normal rank
@@ Property / cites work @@
+Scheduling modular projects on a bottleneck resource
+Normal rank
@@ Property / cites work @@
+Rangen: A random network generator for activity-on-the-node networks
+Normal rank
@@ Property / cites work @@
+The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
+Normal rank
@@ Property / cites work @@
+Sequencing with Series-Parallel Precedence Constraints
+Normal rank