6. A project requires the completion of eight activities. Th…
6. A project requires the completion of eight activities. The immediate predecessors (predecessors), normal activity time in weeks (normal time), maximum crashing time in weeks (max crash time), and per week crashing cost (crash cost) are shown in the table below. Activity 1 2 3 4 5 6 7 8 predecessors none none none 1,2 1,2,3 3 5,6 4,7 normal time 6 8 7 9 7 7 4 6 max crash time 3 2 3 4 1 2 2 3 crash cost $650 $550 $700 $465 $500 $385 $720 $810 Using the “normal time” values, find and report the early start times, early finish times, late start times, late finish times, and slack for each activity. Identify the critical path and project completion time.
Read Details5. A consulting project requires the completion of eight act…
5. A consulting project requires the completion of eight activities. The means and variances of the activity times for those activities (in weeks) are shown in the table below. Activity A B C D E F G H Mean 10 6 8 11 9 9 11 10 Variance 5 2 3 5 4 3 6 5 Consider the three paths of the network: (1) F-C-B, (2) A-H-E and (3) D-G. Compute the probability of the project taking less than 27 weeks for each path, as well as the overall probability of the project taking less than 27 weeks when all paths are considered.
Read DetailsA company wants to develop a location-distribution plan. The…
A company wants to develop a location-distribution plan. They are considering up to three plant locations (Plant 1, Plant 2, Plant 3) and up to three distribution center locations (DC1, DC2, DC3). The selected plants will ship to the selected DCs and the selected DCs will subsequently ship units to meet demand at four existing warehouses (W1, W2, W3, W4). The table below provides relevant cost information, plant capacities, DC capacities, and warehouse demands. Per unit shipping costs Plant Per unit shipping costs DC Plants to DCs Plant Fixed DCs to Warehouses Fixed DC 1 DC 2 DC 3 Capacity Costs W1 W2 W3 W4 Costs Plant 1 $3.99 $2.56 $2.91 4700 $1000 DC 1 $2.13 $2.94 $1.86 $2.35 $200 Plant 2 $3.72 $3.81 $3.80 4100 $1000 DC 2 $2.19 $2.34 $2.49 $1.51 $200 Plant 3 $3.57 $3.08 $4.13 4200 $1000 DC 3 $2.18 $3.00 $2.99 $1.97 $200 DC capacity 4500 4500 4500 Warehouse demand 2300 1500 2400 1800 Fixed costs for plants and DCs are only realized if they are opened/selected. Prepare an integer linear programming model that, when solved, will determine the plants and DCs to be opened and a shipment plan that will meet the demand at the warehouses yet not exceed the capacity limits of the plants and DCs. The goal is to minimize the total fixed costs of plants and DCs plus the total variable (per unit) costs of shipment.
Read DetailsYou are given the following netlist. What are the resulting…
You are given the following netlist. What are the resulting admittance and current arrays? VSa 1 0 9R0 1 2 1R1 0 2 2R2 2 3 2ISa 0 3 2 Assume the admittance array is called y_add and the current array is called curr. Fill in the arrays with the values they would have AFTER stamping has completed. NOTE: All values must have TWO significant figures in the form X.X, therefore, round to the nearest tenth. Do not include units in your answer! Negative numbers should be entered as -8.5 and positive numbers should be entered as 8.5. The value zero would be 0.0. (That is, NO + in front of positive numbers.) y_add = [y_add_00] [y_add_01] [y_add_02] [y_add_03] [y_add_10] [y_add_11] [y_add_12] [y_add_13] [y_add_20] [y_add_21] [y_add_22] [y_add_23] [y_add_30] [y_add_31] [y_add_32] [y_add_33] curr = [curr_0] [curr_1] [curr_2] [curr_3]
Read Details