onsidering that material procurements follow a Poisson process, with an average rate of one shipment arriving every three workdays (out of the five workdays excluding weekends), A. What is the probability that more than two business days elapse between successive shipments? B. Assume that it has already been two days since the

onsidering that material procurements follow a Poisson process, with an average rate of one shipment arriving every three workdays (out of the five workdays excluding weekends), A. What is the probability that more than two business days elapse between successive shipments? B. Assume that it has already been two days since the

Similar questions

A company specializing in custom-engineered equipment is planning to submit a proposal to the National 5. Aeronautics and Space Administration (NASA) to build an assembled component for a new space station that NASA plans to launch into orbit. The winning proposal will be selected on the basis of both cost and timely delivery. Also, there will be a penalty clause in the NASA contract for late delivery. The company has developed the schedule of activities that are required to produce the assembled component. The activities and precedence requirements are presented in the table below. Three time estimates (in weeks) are given for each activity: optimistic time, most likely time, and pessimistic time. (a) What completion time should the company specify in its proposal in order to be 85% sure that it will complete the project on time? ij Activity Immediate predecessor Optimistic time (weeks) a b d. h b e, d d e,f f,g h, i a a a 15 8 10 20 17 4 10 Most likely time (weeks) 24 16 10 14 26 23…
Problem 3: Location Selection for EXP Logistics EXP logistics is a third party logistic company that operates several distribution centers at multiple locations. The company recently decided to expand its warehouse coverage in Texas and planned to construct new warehouses in several candidate sites. The company has two types of warehouses: Mega warehouses and Regular warehouses. Mega warehouses have larger capacity than Regular warehouses. There are 8 different sites available for the company to build new warehouses. The company can build either type of warehouses at a given site. However, the company can build at most one warehouse at any location. The following table summarizes the estimated net present value (NPV) of the cash flows (in million) resulting from locating each type of warehouse at each of the sites and also indicates which sites are within 20 miles of each other. Site 1 2 3 4 5 6 7 8 Mega Warehouse NPV Regular Warehous NPV Other Sites within 20 miles 2,3,5,6 1,3,4,7…
Guests are arriving at a party at a rate of 12 per minute. Each guest will be checked in by a receptionist, served a drink by a bartender, and accompanied to his/her table by one usher. Both the receptionist and usher can serve 10 guests per minute, whereas the bartender takes 5 minutes to serve one guest. The is a non bottleneck resource and its utilization is bartender, 100% receptionist, 20% usher, 100% usher, 2%
Use Brute Force approach to solve the Assignment Problem for the following Person/Job table. (i.e. Assign three person to three jobs, one person to each job to obtain the minimum cost). Answer by guessing or inspection will earn no credit. Work through the br Job1 Job2 Job3 Person1 9. 2 4 Person 3 1 2 Person 6. 4 3 LO
Table 1. 4 processes arriving shown in Operating System Scheduling PDF for Shortest Job Next, non- preemptive Process Arrival Times Execution Times Service Times sequence Wait Times calculations PO 0 12 P1 21 9 P2 41 6 P3 6 3 Total wait time = ? Here the 4 processes of the PDF are repeated in Table 1, with arrival times changed to 0, 2, 4, and 6 respectively. Also, the execution times are changed to 12, 9, 6, and 3. You will be asked to fill table 1 with the numbers like the service times (when is each process serviced), the sequence of executions of these 4 processes in part (a) and part (b) below. Also, you will compute the total wait time. Note for FCFS, it is 1, 2, 3, 4 for P0, P1, P2, and P3; • for the SJN or Shortest Job Next with non-preemptive, PO is #1, P1 may not be #2; for SRT, or shortest remaining time, the preemptive version of SJN, PO is #1, but after 2 time units when P1 comes, P1 kicks out PO since its execution time is 4 < 9- 2 = 7; and P1 may be preempted by P2 later…
You are building a classification model to predict whether a firm will go bankrupt within the next 5 years. When you collect the data, you find that the number of instances of firms that went bankrupt is smaller than the number of cases of firms that did not go bankrupt. Specifically, only 7% of the firms went bankrupt, while the rest did not go bankrupt. Once you build the classification model, you need to compare performance against a baseline. Which of the following would be an appropriate baseline? O Always predicting that the firm does not go bankrupt O Making a prediction that a firm goes bankrupt with 7% probability O Always predicting that the firm goes bankrupt Making a prediction from the set (bankrupt, not bankrupt) with equal probability
Consider the task set in Table 1. a) Assume one of the tasks in Table 1 has its deadline reduced by 1. Now, what is the most efficient schedulability test for determining whether the task set in Table 1 is schedulable under preemptive RM?
Given the following business scenario, create a Crow’s Foot ERD using a specialization hierarchy if appropriate. Eastern Sales Company keeps information on employees and the departments that they work in. For each department, the department name, internal mail box number, and office phone extension are kept. A department can have many assigned employees, and each employee is assigned to only one department. Employees can be salaried employees, hourly employees, or contract employees. All employees are assigned an employee number. This is kept along with the employee’s name and address. For hourly employees, hourly wage and target weekly work hours are stored (e.g. the company may target 40 hours/week for some, 32 hours/week for others, and 20 hours/week for others). Some salaried employees are salespeople that can earn a commission in addition to their base salary. For all salaried employees, the yearly salary amount is recorded in the system. For salespeople, their…
Sherman Company employs 400 production, maintenance, and janitorial workers in eight separate departments. In addition to supervising operations, the supervisors of the departments are responsible for recruiting, hiring, and firing workers within their areas of responsibility. The organization attracts casual labor and experiences a 20 to 30 percent turnover rate in employees per year. Employees clock on and off the job each day to record their attendance on time cards. Each department has its own clock machine located in an unattended room away from the main production area. Each week, the supervisors gather the time cards, review them for accuracy and sign and submit them to the payroll department for processing. In addition, the supervisors submit personnel action forms to reflect newly hired and terminated employees. From these documents, the payroll clerk prepares payroll checks and updates the employee records. The supervisor of the payroll department signs the paychecks, which…
We estimate the following LRM for the relationship between COURSE_EVAL and AGE of the instructor: E(COURSE_EVAL | AGE) = 4.774 -0.2154 * log(AGE) where the AGE variable is transformed with the logarithmic function. Provide an interpretation of the coefficient estimate -0.2154.
Given the following jobs/processes, job lengths, and arrival times, compute the completion time,turnaround time, and waiting time for each job in a table. Draw the Gantt chart and suggest anapplication for each job. (Consider 5 as a highest priority and 0 as a lowest priority).a. First Come First Serve (FCFS)b. Shortest Job First Scheduling (SJF) algorithm.c. Shortest Remaining time (SRT) algorithm.BN104 Operating System 4Prepared by: Archana Banepali Moderated by: Dr Rajan Kadel T1, 2023Question 4d. Non-preemptive priority scheduling algorithme. Pre-emptive priority Scheduling algorithmf. Round-Robin Scheduling algorithm (consider time slice is 4ms).Process Burst Time ArrivalTimePriorityP1 11 2 3P2 28 1 1P3 2 3 4P4 10 4 2P5 16 5 5Table: Processes with Arrival Time, Burst Time and Priority