Question: I need a python code for this question: An IT company has N number of experienced developers. Each month new developers are hired but none

I need a python code for this question: An IT company has N number of experienced developers. Each month new developers are hired but
none are fired. Training of a new developer takes 1 month and each trainee needs 1 experienced
developer to spend 1 month acting as a supervisor rather than working in the projects. Each month
some di number of experienced developers are needed (i=1,2,dots,T), excluding the ones who acts as
supervisor. p% of experienced developers leave the job every month but none of the trainees leave.
Trainees are paid TS and experienced developers EDS. Assume that at the end of the planning
period (Tth month) there should be at least N number of experienced employees.
a) Set up a dynamic programming formulation to minimize payroll cost in months 1,2dots. T. Identify
the states/stages and define variables, write recursion formula and solution procedure.
b) Solve the dynamic programming recursion using a software (python or excel) with the following
parameters
T (planning period) : 12 months
Initial number of experienced developers (N) : 70
Salary of a trainee (TS): 40K
Salary of an experienced developer (EDS): 60K
Turnover rate (p):10%
Demand for experienced developer: Months=>123456789101112 Assume that number of experienced developers leave the job is calculated by rounding down 10% of
experienced developers.
c) Suppose that if the salary of an experienced developer (EDS) is increased to 70K, the turnover
rate (p) will decrease to 5%. Should such a change be made in terms of total payroll cost?
 I need a python code for this question: An IT company

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!