Introduction to Operations ResearchCD-ROM contains: Student version of MPL Modeling System and its solver CPLEX -- MPL tutorial -- Examples from the text modeled in MPL -- Examples from the text modeled in LINGO/LINDO -- Tutorial software -- Excel add-ins: TreePlan, SensIt, RiskSim, and Premium Solver -- Excel spreadsheet formulations and templates. |
From inside the book
Results 1-3 of 92
Page 477
Scheduling Individual Activities The PERT / CPM scheduling procedure begins by addressing Question 4 : When can the ... Having no delays means that ( 1 ) the actual duration of each activity turns out to be the same as its esti- mated ...
Scheduling Individual Activities The PERT / CPM scheduling procedure begins by addressing Question 4 : When can the ... Having no delays means that ( 1 ) the actual duration of each activity turns out to be the same as its esti- mated ...
Page 481
Since an activity's immediate successors cannot start until the activity finishes , this rule is saying that the activity must finish in time to enable all its immediate successors to be- gin by their latest start times .
Since an activity's immediate successors cannot start until the activity finishes , this rule is saying that the activity must finish in time to enable all its immediate successors to be- gin by their latest start times .
Page 498
Yj = start time of activity j ( for j = B , C , . . . , N ) , given the values of XA , XB , XN . ( No such variable is needed for activity A , since an activity that begins the project is au- tomatically assigned a value of 0. ) ...
Yj = start time of activity j ( for j = B , C , . . . , N ) , given the values of XA , XB , XN . ( No such variable is needed for activity A , since an activity that begins the project is au- tomatically assigned a value of 0. ) ...
What people are saying - Write a review
Reviews aren't verified, but Google checks for and removes fake content when it's identified
User Review - Flag as inappropriate
i
User Review - Flag as inappropriate
I want review this book
Other editions - View all
Introduction to Operations Research Frederick S. Hillier,Gerald J. Lieberman No preview available - 2001 |
Common terms and phrases
activity additional algorithm allowable amount apply assigned basic solution basic variable BF solution bound boundary called changes coefficients column complete Consider Construct corresponding cost CPF solution decision variables described determine developed dual problem entering equations estimates example feasible feasible region feasible solutions FIGURE final flow formulation functional constraints given gives goal identify illustrate increase indicates initial iteration linear programming linear programming model Maximize million Minimize month needed node objective function obtained operations optimal optimal solution original parameters path perform plant possible presented primal problem Prob procedure profit programming problem provides range resource respective resulting revised sensitivity analysis shown shows side simplex method simplex tableau slack solve step Table tableau tion unit values weeks Wyndor Glass x₁ zero