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