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 91
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 duration
...
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 duration
...
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. For example, consider activity M in
Fig.
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. For example, consider activity M in
Fig.
Page 498
(No such variable is needed for activity A, since an activity that begins the project
is automatically assigned a value of 0.) By treating the FINISH node as another
activity (albeit one with zero duration), as we now will do, this definition of y-j for ...
(No such variable is needed for activity A, since an activity that begins the project
is automatically assigned a value of 0.) By treating the FINISH node as another
activity (albeit one with zero duration), as we now will do, this definition of y-j for ...
What people are saying - Write a review
User Review - Flag as inappropriate
i
User Review - Flag as inappropriate
I want review this book
Contents
SUPPLEMENT TO APPENDIX 3 | 3 |
Problems | 6 |
An Algorithm for the Assignment Problem | 18 |
Copyright | |
44 other sections not shown
Other editions - View all
Common terms and phrases
activity additional algorithm alternative amount analysis apply assigned assumed basic variable begin BF solution bound calculate called changes coefficients column complete Consider constraints Construct corresponding cost CPF solution customers decision demand described determine developed distribution entering equations estimated example expected feasible FIGURE final flow formulation given gives hour identify illustrate increase indicates initial inventory iteration linear programming machine Maximize maximum mean million Minimize month needed node objective function obtained operations optimal optimal solution original parameter path payoff perform plant player possible presented Prob probability problem procedure profit programming problem queueing respectively resulting shown shows side simplex method solution solve step strategy Table tableau tion transportation unit weeks
Bibliographic information
| Title | Introduction to Operations Research McGraw-Hill International Editions McGraw-Hill industrial & plant engineering series McGraw-Hill series in industrial engineering and management science |
| Authors | Frederick S. Hillier, Gerald J. Lieberman |
| Edition | 7, illustrated |
| Publisher | McGraw-Hill, 2001 |
| Original from | Pennsylvania State University |
| Digitized | 26 Aug 2009 |
| ISBN | 0071181636, 9780071181631 |
| Length | 1214 pages |
| Export Citation | BiBTeX EndNote RefMan |