Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
From MaRDI portal
Publication:4152015
Numerical mathematical programming methods (65K05) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Programming involving graphs or networks (90C35)
Cited in
(25)- Scheduling subject to resource constraints: Classification and complexity
- Scheduling tasks on two processors with deadlines and additional resources
- New trends in machine scheduling
- Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Review of properties of different precedence graphs for scheduling problems
- Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge
- Open shop scheduling with some additional constraints
- Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods)
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem
- Scheduling the two-machine open shop problem under resource constraints for setting the jobs
- Optimal preemptive scheduling on a fixed number of identical parallel machines
- An approximation algorithm for the general max-min resource sharing problem
- Algorithm 520
- Scheduling unit-time tasks in renewable resource constrained flowshops
- Resource-constrained project scheduling by simulated annealing
- Nonpreemptive open shop with restricted processing times
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Unit-time scheduling problems with time dependent resources
- Some efficient multi-heuristic procedures for resource-constrained project scheduling
- Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
- Mathematical programming formulations for machine scheduling: A survey
- A survey of variants and extensions of the resource-constrained project scheduling problem
This page was built for publication: Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152015)
