Introduction to Operations Research, Volume 1CD-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 94
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 estimated ...
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 estimated ...
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 begin 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 begin by their latest start times .
Page 498
Y ; = start time of activity j ( for j = B , C , ... , N ) , given the values of x ^ , XB , . . XN ( No such variable is needed for activity A , since an activity that begins the project is automatically assigned a value of 0. ) ...
Y ; = start time of activity j ( for j = B , C , ... , N ) , given the values of x ^ , XB , . . XN ( No such variable is needed for activity A , since an activity that begins the project is automatically assigned a value of 0. ) ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
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 assignment basic solution basic variable BF solution bound boundary called changes coefficients column complete Consider constraints Construct corresponding cost CPF solution decision variables demand described determine direction distribution dual problem entering equal equations estimates example feasible feasible region FIGURE final flow formulation functional constraints given gives goal identify illustrate increase indicates initial iteration linear programming Maximize million Minimize month needed node nonbasic variables objective function obtained operations optimal optimal solution original parameters path Plant possible presented primal problem Prob procedure profit programming problem provides range remaining resource respective resulting shown shows side simplex method simplex tableau slack solve step supply Table tableau tion unit weeks Wyndor Glass zero