A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes

Applications of graph theory (05C90) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (19)

A flow-based tabu search algorithm for the RCPSP with transfer times ⋮ A classification of predictive-reactive project scheduling procedures ⋮ Feasible insertions in job shop scheduling, short cycles and stable sets ⋮ Modelling and solving generalised operational surgery scheduling problems ⋮ Integration of routing into a resource-constrained project scheduling problem ⋮ \(\Gamma\)-robust optimization of project scheduling problems ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Insertion techniques for static and dynamic resource-constrained project scheduling. ⋮ Tropical optimization problems in time-constrained project scheduling ⋮ Time slack-based techniques for robust project scheduling subject to resource uncertainty ⋮ An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances ⋮ Project scheduling under uncertainty: survey and research potentials ⋮ Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results ⋮ A generic deadlock-free reactive scheduling approach ⋮ A lower bound for the job insertion problem. ⋮ A newany-orderschedule generation scheme for resource-constrained project scheduling ⋮ Analysis of reactive deadlock-free scheduling in flexible job shops ⋮ The resource-constrained activity insertion problem with minimum and maximum time lags ⋮ Resource allocation by means of project networks: Dominance results

Cites Work

This page was built for publication: A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes