Question

In: Nursing

1. Recall the nurse-scheduling problem (with full-time nurses only) introduced in class. We now know that...

1. Recall the nurse-scheduling problem (with full-time nurses only) introduced in class. We now know that this staffing plan cannot be achieved with fewer than 8 nurses. However, nurses prefer to work tour 7 because the days off are Saturday and Sunday. Nurses also like tours 1 and 6 because one day off is a Saturday or Sunday, respectively. Reformulate the problem so that it uses exactly 8 nurses but the number of nurses assigned to tours 1, 6 and 7 is maximized while meeting minimum daily staffing needs. How did you reformulate the decision variables, objective function and constraints?

THAT IS ALL I GOT i just need variables and formula

Expert Solution

The general Model

The general form of the nurse scheduling problem takes the form of either a maximization problem (in the case of nurse preferences) or a minimization problem (in the case of nurse costs). Before we formulate the objective function, let us first declare the various sets and parameters that will be used in the formulation.

Sets of Values

S Shifts of the day (1 – AM, 2- PM, 3 - MN)

N =Nurse

D =Days of the planning horizon

L =Leave

M =Demand

O =Supply

P =Preference

C =Cost

E =No of duties required S1 Specific set S1

Sn =Specific set Sn

Parameters

Xnsd =Assignment for nurse n, shift s of day d (with S1, … ,Sn)

Pnd = Leave for nurse n for day d (with S1, … ,Sn)

Pnsd =Preference for nurse n, shift s of day d (with S1, … ,Sn)

Cnsd =Cost for nurse n, shift s of day d (with S1, … ,Sn)

Msd =Demand for shift s of day d (with S1, … ,Sn)

Osd =Supply for shift s of day d (with S1, … ,Sn)

Ens =No of shifts for nurse n for shift s (with S1, … ,Sn)

Thus the objective function can be declared as image uploaded

Nightingale answered 1 year ago

Recall the dynamic programming algorithm we saw in class for solving the 0/1 knapsack problem for...

Recall the dynamic programming algorithm we saw in class for solving the 0/1 knapsack problem for n objects with a knapsack capacity of K. In particular, we characterized our recurrence OPT(j, W) to be following quantity: OPT(j, W) := The maximum profit that can be obtained when selecting from objects 1, 2, . . . , j with a knapsack capacity of W , where (after filling in our dynamic programming table), we return the value stored at OPT(n, K)...

We have to solve only problem 2, I'm sharing Problem 1 only for reference purpose. Problem...

We have to solve only problem 2, I'm sharing Problem 1 only for reference purpose. Problem 1. (25 points) Alice is going to create a notebook including the profile of all her friends. For each of her friends, she would like to keep first-name, last-name, cell number, and birthdate (month and day). At the beginning, she doesn’t know how many spaces she should reserve for recording her friends, so she gradually inputs her friends’ information into it. • Please help...

(1) Recall on February 6 in class we discussed e 0 + e 2πi/n + e...

(1) Recall on February 6 in class we discussed e 0 + e 2πi/n + e 4πi/n + · · · + e 2(n−1)πi/n = 0 and in order to explain why it was true we needed to show that the sum of the real parts equals 0 and the sum of the imaginary parts is equal to 0. (a) In class I showed the following identity for n even using the fact that sin(2π − x) = − sin(x):...

1. In this problem, we assume for convenience that we consider call options for only one...

1. In this problem, we assume for convenience that we consider call options for only one share of a stock. We consider only one stock, and all options are for this stock. We denote the expiration date of the options by T, and we assume that it is the same date for all options considered below. We denote prices as pure numbers, omitting any notation for a currency such as the dollar sign. You may assume that the price C(K)...

1. The time it takes to do the in class problem sets averages 40 minutes. To...

1. The time it takes to do the in class problem sets averages 40 minutes. To test the hypothesis that the problem sets for hypothesis testing will be completed faster a sample of 100 students showed the average time to complete the problem sets was 32 minutes with a standard deviation of 9 minutes. a) At the .05 level do the hypothesis tests get done faster than normal? (note: p = 0) b) Interpret the p-value c) The 95% confidence...

4. Recall the cookie problem from lecture. We have two bowls, Bowl 1 and Bowl 2....

4. Recall the cookie problem from lecture. We have two bowls, Bowl 1 and Bowl 2. Bowl 1 contains 25% chocolate and 75% vanilla cookies; Bowl 2 has 50% of each. For this problem, assume each bowl is large enough that drawing a single cookie does not appreciably alter this ratio. Suppose we draw two cookies from the bowl and they are both chocolate. Calculate the posterior probabilities of the two bowls in two ways: (a) by treating the two...

1. what is genome sequencing? what do we now know about the human genome from sequencing...

1. what is genome sequencing? what do we now know about the human genome from sequencing it? 2. explain different applications of genomics. What are SNPs is and how are they useful? 3. what are the uses of biotechnology in medicine?

Conditional Probability Problem 1 Conditional probability In group of 200 university students, 140 are full time...

Conditional Probability Problem 1 Conditional probability In group of 200 university students, 140 are full time students (80 females and 60 males) and 60 no full time students (40 females and 20 males). Let M=event a student is male W=event a student is a female F=event a student is full time FC= event a student is not full time 1) Find the probability that a student is male and full time 2) Find the probability...

Let’s return to Tallahassee hotel market we considered in Problem Set 1, but now from the...

Let’s return to Tallahassee hotel market we considered in Problem Set 1, but now from the perspective of a hotel manager. Consider a hotel which can supply an unlimited number of hotel rooms at the constant marginal cost c = 20 per room per night, so that the hotel’s total cost function is given by C(q) = 20q. Assume that demand for hotel rooms in Tallahassee takes two possible values: on game days, demand is described by the demand curve...

1) Now, since we know it takes 6.022*10^23 protons to make 1kg I want you to...

1) Now, since we know it takes 6.022*10^23 protons to make 1kg I want you to tell me how many protons there are in the known universe using this data: our star is: 1.989*10^30 kg our galaxy is: 2*10^11 suns in mass there are: 2.5*10^11 galaxies in the universe. So, how many protons must there be in the Universe? 2) If there are 6.022*10^23 protons in 1 kg of mass, and there are 10^3 grams in a kilogram, what is...