Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
From MaRDI portal
Cited in
(30)- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
- Surrogate duality relaxation for job shop scheduling
- A unified formulation of the machine scheduling problem
- A comparative study of computational procedures for the resource constrained project scheduling problem
- An exact algorithm for project scheduling with multiple modes
- Activity nets: A guided tour through some recent developments
- Resource-constrained project scheduling: A survey of recent developments.
- Theoretical expectation versus practical performance of Jackson's heuristic
- Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement
- Deterministic job-shop scheduling: Past, present and future
- Considering project management activities for engineering design groups
- A metric approach for scheduling problems with minimizing the maximum penalty
- 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 branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- MIP models for resource-constrained project scheduling with flexible resource profiles
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
- Algunas variantes del problema de la duracion variable
- Resource-constrained project scheduling by simulated annealing
- A constraint-based perspective in resource constrained project scheduling
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- A high-performance exact method for the resource-constrained project scheduling problem
- 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
- Tri-directional scheduling scheme: theory and computation
- FPT implicit enumeration of active schedules
- Parameterized complexity of a parallel machine scheduling problem
- Maximising the weighted number of activity execution modes in project planning
- Network flows and non-guillotine cutting patterns
- Complexity of the scheduling language RSV
This page was built for publication: Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5595978)
