The resource-constrained activity insertion problem with minimum and maximum time lags
From MaRDI portal
Recommendations
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
- scientific article; zbMATH DE number 4135692
- Lower bounds for resource-constrained project scheduling problems.
- A metaheuristic approach to the resource constrained project scheduling with variable activity durations and convex cost functions
Cites work
- A classification of predictive-reactive project scheduling procedures
- A lower bound for the job insertion problem.
- A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
- Feasible insertions in job shop scheduling, short cycles and stable sets
- Feasible job insertions in the multi-processor-task job shop
- scientific article; zbMATH DE number 4135692 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1175395 (Why is no real title available?)
- scientific article; zbMATH DE number 2013754 (Why is no real title available?)
- scientific article; zbMATH DE number 805284 (Why is no real title available?)
- Insertion of a random task in a schedule: a real-time approach
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- Rescheduling manufacturing systems: A framework of strategies, policies, and methods
- Tabu-search for the multi-mode job-shop problem
- The construction of stable project baseline schedules
Cited in
(2)
This page was built for publication: The resource-constrained activity insertion problem with minimum and maximum time lags
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041351)