Copy machine problem, Computer Engineering

Assignment Help:

We are trying to figure out how many copy machines we should install in the basement of Stranahan Hall.  Copy machines should be available 24/7.  Students may walk up at any time of the day or night for copying.  Based on past data, it can be assumed that the amount of time a student needs to use the copy machine is described by a discrete probability distribution listed below:

Copying time (in min)

Probability

1

0.25

2

0.25

3

0.25

4

0.25

Interarrival times for student arrivals at the copy machine(s) is described by the following discrete distribution-

Interarrival time (min)

Probability

1

0.2

2

0.2

3

0.2

4

0.15

5

0.25

Students hate spending time waiting at the copy machines for their turn to use them.  Students don't depart from the queue until they use the machine.  Service policy is - first come, first serve (whoever arrives first at the machine gets the priority to use the machine).  Suppose that students  time is valued at $10 per hour, i.e., the student could have used the any time wasted just waiting could have been put to use at that wage rate.  Each copy machine  can be leased at rate of $10 per day.  Cost of leasing copy machines is ultimately charged to the common student services.  Given the above information, answer the following-

  • Assume that the university leases one copy machine. What is the total cost of operating the system per day? (this cost includes the cost of time wasted by the students waiting at the copy machine plus the cost of leasing the copy machine).
  • Assume that the university leases two copy machines. What is the total cost of operating the system per day?
  • Assume that the university leases three copy machines. What is the total cost of operating the system per day?

 You must use Simul 8 to build the model, and obtain necessary information to solve the problem.


Related Discussions:- Copy machine problem

Average number of instructions, Consider a processor with a 4-stage pipelin...

Consider a processor with a 4-stage pipeline. Each  time a conditional branch is encountered, the pipeline must be flushed (3 partially completed instructions are lost). Determine

Explain the operation of 8:1 multiplexer, Explain the operation of 8:1 mult...

Explain the operation of 8:1 multiplexer. Ans: In this multiplexer 8 Input and 1 Output and three select lines i.e. S 2 , S 1 , S 0 are given. Any one of the inputs will be

Define relocation bits utilized by relocating loader, Relocation bits used ...

Relocation bits used by relocating loader are specified by? Ans. Relocation bits utilized by relocating loader are identified by Assembler or Translator.

Design issues, Design issues:  To complete the maximum processor utilizatio...

Design issues:  To complete the maximum processor utilization in a multithreaded architecture, the following design issues have to be addressed: Context Switching time: S

Which network connects multiple company locations, A/An                net...

A/An                network is typically a company network that connects multiple company locations into a single network. (A)  local area                                  (B

Extjs, tell some thing about htmleditor in extjs whether it contains attach...

tell some thing about htmleditor in extjs whether it contains attachment button or not

Classification based on grain size, Classification Based On Grain Size ...

Classification Based On Grain Size  This classification is based on identifying  the parallelism in a program to be implemented on a multiprocessor system. The plan is to recog

What are set up time and hold time constraints, What are set up time and ho...

What are set up time and hold time constraints? What do they mean? Which one is crucial for establishing maximum clock frequency of a circuit? Set up time is the amount of time

Explain new services of cpu based exchange, Explain new services of  CPU B...

Explain new services of  CPU Based Exchange. These new services are termed as supplementary services and several of the prominent ones are given below as:  Category 1:

What are different adder circuits you studied, Half Adder (for addition of ...

Half Adder (for addition of two bits) Full Adder (for addition of three bits) Carry look ahead adder Carry save adder Carry propagate adder

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd