Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
Expert Solution & Answer
Book Icon
Chapter 20.9, Problem 9P

Explanation of Solution

Given:

It is given that the Army has 200 tanks. Tanks need maintenance 10 times per year, the maintenance takes an average of 2 days. To have an average of at least 180 tanks working, the number of repairmen needed is to be determined. It is assumed that the inter arrival and service times are exponentially distributed.

Determining the number of repairmen required:

This is similar to a machine repair problem containing “K” machines and “R” repair people is a M|M|R|GD|K|Kqueuing system where the inter arrival times, service times are exponential, R servers, general queue discipline, first “K” implies that at any time, no more than “K” machines may be present, the second “K” implies that the arrivals are drawn from a finite source of size “K”.

The steady state probability at state j is as follows:

πj=(Ckj)ρjπ0            (j=0,1,....,R)     = (Ckj)ρjj!π0R!R(jR)      (j=R+1,R+2,....K) 

Here,

  • R represents the number of servers,
  • K represents the number of machines,
  • λ represents the arrival time, and
  • μrepresents the service rate

ρ=λμ

Let the number of servers or repairmen be R=1, and the number of machines or tanks, K=200.

The arrival rate is, λ=10times/year

The service rate is, μ=3652times/year

Therefore,

ρ=λμ   =103652   =0.05479

This machine repair problem is solved using a spreadsheet. In cell B2, enter the value of arrival rate λ, in cell C2, enter μ, and in cell D2, enter the number of repairers, say 1

Blurred answer
Students have asked these similar questions
Ideal MOSFET Current–Voltage Characteristics—NMOS Device and draw the circuit
1. Create a Person.java file. Implement the public Person and Student classes in Person.java, including all the variables and methods in the UMLS. Person -name: String -street: String -city: String +Person(String name, String, street, String, city) +getName(): String +setName(String name): void +getStreet(): String +setStreet(String street): void +getCity(): String +setCity(String City): void +toString(): String Student -Id: int +Person(String name, String, street, String, city, int Id) +getId(): int +setId(int Id): void +toString(): String 2. Create a StudentTest.java file. Implement a public StudentTest class with a main method. In the main method, create one student object and print the object using System.out.println(). Your printing result must follow the example output: name: Mike, street: Morris Ave, city: Union, Id: 1000 Hint: You need to modify the toString methods in the Student class and Person class!
1) Apply the Paint Blue algorithm discussed in class to the following Finite Automata. a a a b b a COIS-3050H-R-W01-2025WI-COMB Formal Languages & Automata a b Show the status of the Finite Automata at the conclusion of the Paint Blue Algorithm (mark the visited states with an X and only include edges that have not been followed). 2) Use the pumping lemma to prove the following language is nonregular: L= {ab} = {abbb, aabbbbbb, aaabbbbbbbbb, ...}

Chapter 20 Solutions

Operations Research : Applications and Algorithms

Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Text book image
A Guide to SQL
Computer Science
ISBN:9781111527273
Author:Philip J. Pratt
Publisher:Course Technology Ptr
Text book image
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage
Text book image
MIS
Computer Science
ISBN:9781337681919
Author:BIDGOLI
Publisher:Cengage