Scribd
Upload
85 views3 pages

FT FT FT PT

Larry Edison, director of the Computer Center at Buckly College, needs to schedule staffing for the center's operating hours, requiring a specific number of full-time and part-time consultants for different shifts. The linear programming model aims to minimize staffing costs while meeting minimum consultant requirements and maintaining a ratio of full-time to part-time consultants. The optimal integer solution results in hiring 3 full-time morning, 3 afternoon, 4 evening, and 1, 2, 3, and 2 part-time consultants for respective shifts, with a total cost of $4,160.

Uploaded by

Mariella Singson
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
85 views3 pages

FT FT FT PT

Larry Edison, director of the Computer Center at Buckly College, needs to schedule staffing for the center's operating hours, requiring a specific number of full-time and part-time consultants for different shifts. The linear programming model aims to minimize staffing costs while meeting minimum consultant requirements and maintaining a ratio of full-time to part-time consultants. The optimal integer solution results in hiring 3 full-time morning, 3 afternoon, 4 evening, and 1, 2, 3, and 2 part-time consultants for respective shifts, with a total cost of $4,160.

Uploaded by

Mariella Singson
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

3.4-11. Larry Edison is the director of the Computer Center for the Buckly College.

He now
needs to schedule the staffing of the center. It is open from 8 am until midnight. Larry has
monitored the usage of the center at various times of the day, and determined that the
following number of computer consultants are required:

Time of the Day Minimum Number of Consultants Required


to be on Duty
8 am – Noon 4
Noon – 4 pm 8
4 pm – 8 pm 10
8 pm - Midnight 6

Two types of computer consultants can be hired: full-time and part-time. The full-
time consultants work for 8 hours a day in any time of the following shifts: morning(8am –
4pm), afternoon(noon- 8pm) and evening(4pm – midnight). Full-time consultants are paid
$40 per hour.

Part-time consultants can be hired to work of any of the 4 shifts listed in the above
table. Part-time consultants are paid $30 per hour.

An additional requirement is that during every time period, there must be at least 2-
full-time consultants on duty for every for every part-time consultant on duty.

Larry would like to determine how many full-time and how many part-time workers
should work each shift to meet the above requirements at minimum possible cost.

a. Formulate a linear programming model for this problem

b. Solve this model by the simplex method

A. Linear Programming model

Let ft- 1 = number of full-time consultants working the morning shift (8 a.m.-4 p.m.)

ft- 2 = number of full-time consultants working the afternoon shift (Noon-8 p.m.)

ft- 3 = number of full-time consultants working the evening shift (4 p.m.-midnight)

pt1 = number of part-time consultants working the first shift (8 a.m.-noon)


pt2 = number of part-time consultants working the second shift (Noon-4 p.m.)

pt3= number of part-time consultants working the third shift (4 p.m.-8 p.m.)

pt4 = number of part-time consultants working the fourth shift (8 p.m.-midnight)

Minimize

C=( 40∗8)∗( ft 1 +ft 2 +ft 3 )+(30∗4 )∗( pt 1 + pt 2 + pt 3 + pt 4 )

Constraints

ft1 + pt1 ≥ 4

ft1 + ft2 + pt2 ≥ 8

ft2 + ft3 + pt3 ≥ 10

f3 + pt4 ≥ 6

ft1 ≥ 2pt1

ft1 + ft2 ≥ 2pt2

ft2 + ft3 ≥2pt3

ft3 ≥ 2pt4

ft1, ft2,ft3,pt1,pt2,pt3,pt4≥0

B. Simplex Model

Total Quantit Constan


Cost Variable y constraints t
4106.6
7 Full-time 1 (8am-4pm) 2.66667 4 ≥ 4
Full-time 2(noon - 8pm) 2.66667 8 ≥ 8
Full-time 3(4pm-
midnight) 4 10 ≥ 10
part-time 1(8am-noon) 1.33333 6 ≥ 6
2.6666666
part-time 2(noon-4pm) 2.66667 7 ≥ 2.66667
5.3333333
part-time 3(4pm-8pm) 3.33333 3 ≥ 5.33333
part-time 4(8pm- 6.6666666
midnight) 2 7 ≥ 6.66667
4 ≥ 4
Full-time 1 ≥ 0
Full-time 2 ≥ 0
Full-time 3 ≥ 0
part-time 1 ≥ 0
part-time 2 ≥ 0
part-time 3 ≥ 0
part-time 4 ≥ 0

The optimal solution has fractional components. If the number of consultants have to
be integer, then the problem is an integer programming problem and the solution is
(3,3,4,1,2,3,2) with cost of $4,160.

You might also like