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 77
Page 511
Dealing with Overlapping Activities Another key assumption of PERT / CPM is
that an activity cannot begin until all its immediate predecessors are completely
finished . Although this may appear to be a perfectly reasonable assumption , it
too ...
Dealing with Overlapping Activities Another key assumption of PERT / CPM is
that an activity cannot begin until all its immediate predecessors are completely
finished . Although this may appear to be a perfectly reasonable assumption , it
too ...
Page 583
Scheduling Interrelated Activities We all schedule interrelated activities in our
everyday lives , even if it is just scheduling when to begin our various homework
assignments . So too , managers must schedule various kinds of interrelated ...
Scheduling Interrelated Activities We all schedule interrelated activities in our
everyday lives , even if it is just scheduling when to begin our various homework
assignments . So too , managers must schedule various kinds of interrelated ...
Page 880
In other words , customers are selected to begin service in the order of their
priority classes , but on a first - come - firstserved basis within each priority class .
A Poisson input process and exponential service times are assumed for each
priority ...
In other words , customers are selected to begin service in the order of their
priority classes , but on a first - come - firstserved basis within each priority class .
A Poisson input process and exponential service times are assumed for each
priority ...
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 | |
57 other sections not shown
Other editions - View all
Common terms and phrases
activity additional algorithm allocation allowable amount apply assignment basic solution basic variable BF solution bound boundary calculations called capacity changes coefficients column complete Consider constraints construct corresponding cost CPF solution demand described determine direction distribution dual problem entering equal equations estimates example feasible FIGURE final flow problem Formulate 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 resource respective resulting revised Select shown shows side simplex method simplex tableau slack solve step supply Table tableau tion unit values weeks Wyndor Glass zero