A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems
From MaRDI portal
Recommendations
- A decomposition approach for a resource constrained scheduling problem
- scientific article; zbMATH DE number 432991
- A constraint integer programming approach for resource-constrained project scheduling
- Principles and Practice of Constraint Programming – CP 2004
- Hybrid algorithm for project scheduling with capacity constraint
Cited in
(14)- Constraint programming and operations research
- A cutting plane approach for integrated planning and scheduling
- A hybrid framework for over-constrained generalized resource-constrained project scheduling problems
- Hybrid algorithm for scheduling with regard for reinvestment of profits
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- Decomposition methods for the parallel machine scheduling problem with setups
- A branch-and-cut algorithm for a resource-constrained scheduling problem
- Logic-based Benders decomposition for large-scale optimization
- Hybrid algorithm for project scheduling with capacity constraint
- Shop scheduling in manufacturing environments: a review
- Logic-based benders decomposition methods for the distributed permutation flow shop scheduling problem with production and transportation cost
- Fast combination of scheduling chains under resource and time constraints
- A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
- Integrated airline scheduling
This page was built for publication: A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450925)