fourth-year engineering student is seeking part-time jobs to get work experience financial income. The student can set aside 300 hours for the planning period in which she wants to work. As a consequence of the interviews, the student received four employment offers. These works are composed of multiple tasks. She can choose to work for any number of tasks of one or more works. In the table below, required time the student should spend on each of these tasks, the number of tasks she may do for each of these works, and the earnings she will get if she accomplishes each task once are given. Work Type # of tasks Required time per task (hrs) Fee per Task ( Dollarx 100) A 100 20 B 50 10 30 7 D 3 20 3 a. The student wants to find out which work(s) to select and number tasks she will do in order to earn the most amount of money. Formulate a dynamic programming recursion that maximizes the student's total earnings from their work selection decisions (Define State, Stage, Decision, Recursion formula, and Solution procedure). And solve the model manually. 224

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter11: Simulation Models
Section: Chapter Questions
Problem 69P: The Tinkan Company produces one-pound cans for the Canadian salmon industry. Each year the salmon...
icon
Related questions
Question
A fourth-year engineering student is seeking part-time jobs to get work experience and financial
income. The student can set aside 300 hours for the planning period in which she wants to work. As a
consequence of the interviews, the student received four employment offers. These works are
composed of multiple tasks. She can choose to work for any number of tasks of one or more works. In
the table below, required time the student should spend on each of these tasks, the number of tasks
she may do for each of these works, and the earnings she will get if she accomplishes each task once
are given.
Work Type
# of tasks
Required time per
Fee per Task
task (hrs)
( Dollarx 100)
A
2
100
20
В
2
50
10
4
30
7
D
3
20
3
a. The student wants to find out which work(s) to select and number tasks she will do in order
to earn the most amount of money. Formulate a dynamic programming recursion that
maximizes the student's total earnings from their work selection decisions (Define State,
Stage, Decision, Recursion formula, and Solution procedure). And solve the model manually.
Transcribed Image Text:A fourth-year engineering student is seeking part-time jobs to get work experience and financial income. The student can set aside 300 hours for the planning period in which she wants to work. As a consequence of the interviews, the student received four employment offers. These works are composed of multiple tasks. She can choose to work for any number of tasks of one or more works. In the table below, required time the student should spend on each of these tasks, the number of tasks she may do for each of these works, and the earnings she will get if she accomplishes each task once are given. Work Type # of tasks Required time per Fee per Task task (hrs) ( Dollarx 100) A 2 100 20 В 2 50 10 4 30 7 D 3 20 3 a. The student wants to find out which work(s) to select and number tasks she will do in order to earn the most amount of money. Formulate a dynamic programming recursion that maximizes the student's total earnings from their work selection decisions (Define State, Stage, Decision, Recursion formula, and Solution procedure). And solve the model manually.
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,