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

DOI10.1145/355744.355755zbMath0374.90033OpenAlexW2066602694MaRDI QIDQ4152015

Wojciech Cellary, Slowinski, Roman, Jacek Błażewicz, Jan Weglarz

Publication date: 1977

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/355744.355755

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (25)

Scheduling tasks on two processors with deadlines and additional resources ⋮ A tabu-search heuristic for the flexible-resource flow shop scheduling problem ⋮ New trends in machine scheduling ⋮ Open shop scheduling with some additional constraints ⋮ Nonpreemptive open shop with restricted processing times ⋮ Scheduling unit-time tasks in renewable resource constrained flowshops ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Multiobjective network scheduling with efficient use of renewable and nonrenewable resources ⋮ Scheduling the two-machine open shop problem under resource constraints for setting the jobs ⋮ Unit-time scheduling problems with time dependent resources ⋮ Optimal preemptive scheduling on a fixed number of identical parallel machines ⋮ An approximation algorithm for the general max-min resource sharing problem ⋮ Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods) ⋮ 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 ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ 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 ⋮ Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness ⋮ Algorithm 520 ⋮ Review of properties of different precedence graphs for scheduling problems ⋮ Scheduling subject to resource constraints: Classification and complexity ⋮ Resource-constrained project scheduling by simulated annealing ⋮ Mathematical programming formulations for machine scheduling: A survey ⋮ Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge

This page was built for publication: Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]