Algorithm 520

swMATH25818MaRDI QIDQ37552FDOQ37552

Author name not available (Why is that?)

Described by source

• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]

Cited In (7)

• Scheduling subject to resource constraints: Classification and complexity
• New trends in machine scheduling
• Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
• Some efficient multi-heuristic procedures for resource-constrained project scheduling
• Review of properties of different precedence graphs for scheduling problems
• Optimal preemptive scheduling on a fixed number of identical parallel machines

This page was built for software: Algorithm 520