Introduction to Operations Research, Volume 1-- This classic, field-defining text is the market leader in Operations Research -- and it's now updated and expanded to keep professionals a step ahead -- Features 25 new detailed, hands-on case studies added to the end of problem sections -- plus an expanded look at project planning and control with PERT/CPM -- A new, software-packed CD-ROM contains Excel files for examples in related chapters, numerous Excel templates, plus LINDO and LINGO files, along with MPL/CPLEX Software and MPL/CPLEX files, each showing worked-out examples |
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 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
...
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
...
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. ) By treating the FINISH node as ...
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. ) By treating the FINISH node as ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Common terms and phrases
activity additional algorithm alternative amount analysis apply assignment assumed basic variable begin BF solution 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 mean million Minimize month needed node objective function obtained operations optimal optimal solution original parameter path payoff 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 waiting weeks
Bibliographic information
| Title | Introduction to Operations Research, Volume 1 Introduction to Operations Research, Frederick S. Hillier 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 | the University of Michigan |
| Digitized | 8 Aug 2011 |
| ISBN | 0072416181, 9780072416183 |
| Length | 1214 pages |
| Export Citation | BiBTeX EndNote RefMan |