Algorithm 520

MaRDI QIDQ37552swMATHFDO

Official website https://dl.acm.org/citation.cfm?doid=355744.355755

Described by source

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

Cited in

(8)

• Scheduling subject to resource constraints: Classification and complexity
• Bison
• Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
• New trends in machine scheduling
• 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