Iterated Variable Neighborhood Search for the resource constrained multi-mode multi-project scheduling problem

@article{Geiger2013IteratedVN,
  title={Iterated Variable Neighborhood Search for the resource constrained multi-mode multi-project scheduling problem},
  author={Martin Josef Geiger},
  journal={CoRR},
  year={2013},
  volume={abs/1310.0602}
}
The resource constrained multi-mode multi-project scheduling problem (RCMMMPSP) is a notoriously difficult combinatorial optimization problem. For a given set of activities, feasible execution mode assignments and execution starting times must be found such that some optimization function, e. g. the makespan, is optimized. When determining an optimal (or at least feasible) assignment of decision variable values, a set of side constraints, such as resource availabilities, precedence constraints… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 2 times. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Project Scheduling: A Research Handbook

E. L. Demeulemeester, W. S. Herroelen
Kluwer Academic Publishers • 2002
View 4 Excerpts
Highly Influenced

The critical-path method: Resources planning and scheduling

J. E. Kelley
J.F. Muth, G.L. Thompson (eds.) Industrial Scheduling, pp. 347–365. Prentice Hall, Englewood Cliffs • 1963
View 4 Excerpts
Highly Influenced

Variable neighborhood search: Principles and applications

European Journal of Operational Research • 2001
View 2 Excerpts

Similar Papers

Loading similar papers…