a) In on-site time study of mechanically loaded, stationary-container system (SCS), the time it takes to empty all locations in a collection route is 240 minutes. The average driving time between containers location is 0.92 hours. If there are 8 containers, calculate: i. Time to pick up and load,p ii. The average between collection-point driving time per collection point,d₁

a) In on-site time study of mechanically loaded, stationary-container system (SCS), the time it takes to empty all locations in a collection route is 240 minutes. The average driving time between containers location is 0.92 hours. If there are 8 containers, calculate: i. Time to pick up and load,p ii. The average between collection-point driving time per collection point,d₁

Solid Waste Engineering

3rd Edition

ISBN:9781305635203

Author:Worrell, William A.

Publisher:Worrell, William A.

Chapter3: Collection

Section: Chapter Questions

Problem 3.16P

See similar textbooks

Similar questions

Given: A stationary container system (mechanically loaded), 3.5 collection trips/wk, 8hrs/day, 3.22 h/trip (pick up time), at site time 1h/trip, round trip = 10miles, a=.018 h/trip. b= .020h/trip, productive time = 85% Note: Even though a partial trip (3.5 collection trips), a full trip (4) will have to be mad to the disposal area. Find: Time required per week.
Q/3 B: We have the following network diagram and ask us to shorten the time to achieve the best possible economic feasibility. Find the amount of this time and cost? Act. Normal Crash Time/m Cost S Time/m Cost S 3030 2500 6000 5300 4500/ 2000 4050 1-2 3030 2-3 3 2200 2-4 2. 6000 2-5 3-5 4-5 5-6 5100 4 2. 4100 2000 4050 8. 2250 50
3. Calculate the least-cost, duration for the following project. Calculate the cost associated with the duration. Indirect (overhead) costs are $100 per day. Duration (days) Cost ($) Activity IPA Normal Crash Normal Crash A 500 640 А 6. 550 630 A 8. 800 935 10 7 1,200 1,440 E В, С 6. 4 600 700 F 4 500 590 G D, F 700 1,000 H Е, F 7 650 950 G, H 2 300 300 Best wishes
There are five machines located at the points (0, 0), (2, 0), (0, 2), (2, 3) and (4,3) respectively. A repair shop is planned in the facility. The foreman claims that for any number of expected repair trips between these machines and the repair shop, the optimal location of the new facility can never be at the location (2,1). State whether this claim is true or false.
Q2) Prepare a time schedule for the construction for 80 houses using line of balance technique according to the data shown below assuming a rate of built =5 hours/ week and buffer time between activities equal=3 days. 6 day/week and 8 hrs. /day. Operation Mhr (Q) Operation no. of men/ operation 100 80 C 60 D 120 3 E 180 250 6 20 B D 10 15 25 30
Engineering Management ,i need solutions in 10 minutes please. MCQ/The delay time in starting or finishing an activity without affecting on the total duration of a project is known as: A-Duration B-Free float C-Total float D-Interfering float
A traffic pacing operation was conducted by a highway patrol unit (see Figure Q2(a)) to slow down upstream traffic on a highway due to maintenance works being conducted downstream. The speed of the highway patrol unit during this operation was 40 km/h and the upstream traffic density was 150 vehicles/km. After passing the location of the maintenance works, the highway patrol unit left the traffic stream, causing traffic speed to increase to 70 km/h and density to settle at 50 vehicles/km. (i) Develop a mathematical relationship between speed and density. (ii) Will the upstream traffic flow reach the maximum flow?
10. From the following table, draw the precedence network, perform the CPM calculations, and complete the table entries, assuming interruptible activities. Activity A ABCO с Duration IPA Type Rel Lag ES 3 3526 5 2 6 LAABC А B с SS FF 3 EF LS LF TF FF "If the relationship type is not mentioned, it is finish to start (FS). If no lag is mentioned, it is zero.
QI: For the activities shown in the table below, find the total duration (T D) and critical paths (C P) using Activity On Node method (A O N). Activity ABCDREFG HI J K L M Duration 3 4 7 45 11 8 3 4 2 1 3 59 Proceeded --- A ABCCEGRRHIK by JL
Consider the following plot of cumulative arriving and departing vehicles at a freeway bottleneck location: Vehicles 20,000 15,000 10,000 5,000 0 0 30 60 90 120 150 180 210 240 270 300 330 360 Time (mins) Arrivals (vehs) Departures (vehs) From this plot, determine the following: A. What is the capacity of the bottleneck location? 9000 whole number, i.e. X000.) B. What is the maximum size of the queue that develops? 3250 whole number, i.e. X000.) C. What is the longest wait time that any vehicle experiences during the breakdown? to the nearest whole number, i.e. XX.) (Hint: Provide the answer as a numerical number only in units of vehicles per hour and rounded to the nearest thousand (Hint: Provide the answer as a numerical number only in units of vehicles and rounded to the nearest thousand (Hint: Provide the answer as a numerical number only in units of minutes and rounded
Airplanes anive at an airport area at an average rate of six per hour according to the Poisson distribution. The airport control tower processes airplanes in their order of arrival. Assuming that theservice time is negative exponential'and that the service rate is ten landings per hour, calculate(1) the average number of airplanes in the system (i.e., being served and stacked), (2) the averagenumber Of airplanes aW~ting clearance to land, (3) the average time spent in the system, and (4) theaverage time an airplane is in the queue.
1. Planners have estimated the following models for the AM Peak Hour T₁ = 1.5 H₁ T; - (1.5 Euj1) + (1 Euthy) + (0.5 Eretj) Where: T - Person Trips Originating in Zone i T₁ = Person Trips Destined for Zone j H Esti Eath Eret Variable 10000 8000 3000 2000 Data Dakotopolis 15000 10000 5000 1500 New Fargo A. What are the number of person trips originating in and destined for each city? B. Normalize the number of person trips so that the number of person trip origins = the number of person trip destinations. Assume the model for person trip origins is more accurate.