ABC Company provides a service to its clients. Each client has a job with a processing time of several days. Once the process starts for a client's job, it must be carried out without any interruption. Each client's job requires a certain number of operators in each day of its process. ABC must create a plan for the 4 available clients' jobs for the next 5 days with minimum number of operators needed to satisfy this demand. The processing time of the client's jobs and the number of operators each of them needs in each day is given below. For instance, client 1 has a job that lasts for 2 days, and 2 and 3 operators are needed for days 1 and 2 of its execution.

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter12: Queueing Models
Section: Chapter Questions
Problem 59P
icon
Related questions
Question
ABC Company provides a service to its clients. Each client has a job with a processing time of several
days. Once the process starts for a client's job, it must be carried out without any interruption. Each
client's job requires a certain number of operators in each day of its process. ABC must create a plan
for the 4 available clients' jobs for the next 5 days with minimum number of operators needed to
satisfy this demand. The processing time of the client's jobs and the number of operators each of them
needs in each day is given below. For instance, client 1 has a job that lasts for 2 days, and 2 and 3
operators are needed for days 1 and 2 of its execution.
Number of operators needed per day
Client
1
2
3
4
Processing time in
days
1
N
2
2
1
3
3
3
3
3
4
сл
I
(a) Formulate an integer linear programming model to minimise the total operators needed.
Describe decision variables, objective function, and constraints properly.
(b) Solve the ILP formulated in part (a) using Excel Solver. What is the optimal solution and total
operators needed?
(c) Job 2 must start at least one day before job 3. For example, job 2 can start on day 1 and job 2
can start on days 2, 3, 4, or 5. Modify your model and add this condition.
(d) Solve the modified ILP formulated in part (c). Explain how the optimal solution is different
from part (b).
(e) If job 1 is started on day 1 then job 4 also must be started on day 1. Modify your model to
accommodate this condition.
Transcribed Image Text:ABC Company provides a service to its clients. Each client has a job with a processing time of several days. Once the process starts for a client's job, it must be carried out without any interruption. Each client's job requires a certain number of operators in each day of its process. ABC must create a plan for the 4 available clients' jobs for the next 5 days with minimum number of operators needed to satisfy this demand. The processing time of the client's jobs and the number of operators each of them needs in each day is given below. For instance, client 1 has a job that lasts for 2 days, and 2 and 3 operators are needed for days 1 and 2 of its execution. Number of operators needed per day Client 1 2 3 4 Processing time in days 1 N 2 2 1 3 3 3 3 3 4 сл I (a) Formulate an integer linear programming model to minimise the total operators needed. Describe decision variables, objective function, and constraints properly. (b) Solve the ILP formulated in part (a) using Excel Solver. What is the optimal solution and total operators needed? (c) Job 2 must start at least one day before job 3. For example, job 2 can start on day 1 and job 2 can start on days 2, 3, 4, or 5. Modify your model and add this condition. (d) Solve the modified ILP formulated in part (c). Explain how the optimal solution is different from part (b). (e) If job 1 is started on day 1 then job 4 also must be started on day 1. Modify your model to accommodate this condition.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 6 images

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,