I'm looking for advice on where to get started in terms of literature, techniques, keywords and standard formulations etc.

An organisation has a complex training program (represented as a digraph) where recruits of various types pass through training courses to reach placements within various offices/departments. Passing through all courses to reach a placement may take several years, and 5-10 courses. Courses have sessions at set times, maximum capacities, and random failure rates. Departments have random attrition each year.

The problem is how to maintain the required placements within the various offices/departments with some specified probability over some horizon. The decision variables are how many to recruit initially, and how many to advance along the various paths through the training continuum. (Recruits are not necessarily pre-committed to ultimate destinations.)

I see stochastic optimisation techniques often defined in terms of maximising expectations but this problem is more - find minimal recruitment such that the desired risk level across the placements is satisfied during the horizon.

Where to get started with this problem? Is there literature for this type of problem and if so what are the relevant keywords? What are the natural techniques to try first?

asked 10 Apr '18, 06:28

mathstudent's gravatar image

accept rate: 0%

Be the first one to answer this question!
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "Title")
  • image?![alt text](/path/img.jpg "Title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported



Asked: 10 Apr '18, 06:28

Seen: 421 times

Last updated: 10 Apr '18, 06:28

OR-Exchange! Your site for questions, answers, and announcements about operations research.