Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
From MaRDI portal
Publication:5595978
DOI10.1287/opre.18.2.263zbMath0197.46005OpenAlexW2128896782MaRDI QIDQ5595978
Publication date: 1970
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.18.2.263
Related Items (28)
Algunas variantes del problema de la duracion variable ⋮ MIP models for resource-constrained project scheduling with flexible resource profiles ⋮ An exact algorithm for project scheduling with multiple modes ⋮ Theoretical expectation versus practical performance of Jackson's heuristic ⋮ Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem ⋮ Activity nets: A guided tour through some recent developments ⋮ Project scheduling to minimize the makespan under flexible resource profiles and marginal diminishing returns of the resource ⋮ Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems ⋮ Resource-constrained project scheduling: A survey of recent developments. ⋮ An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime ⋮ Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement ⋮ Surrogate duality relaxation for job shop scheduling ⋮ Tri-directional scheduling scheme: theory and computation ⋮ Considering project management activities for engineering design groups ⋮ A metric approach for scheduling problems with minimizing the maximum penalty ⋮ An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling ⋮ A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates ⋮ A constraint-based perspective in resource constrained project scheduling ⋮ 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 high-performance exact method for the resource-constrained project scheduling problem ⋮ Maximising the weighted number of activity execution modes in project planning ⋮ A unified formulation of the machine scheduling problem ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Network flows and non-guillotine cutting patterns ⋮ Resource-constrained project scheduling by simulated annealing ⋮ A comparative study of computational procedures for the resource constrained project scheduling problem ⋮ An upper bound for the speedup of parallel best-bound branch-and-bound algorithms ⋮ Complexity of the scheduling language RSV
This page was built for publication: Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
