## 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 53

Page 835

17.1 17.2 After some general discussion, this chapter presents most of the more

elementary

the information provided by

17.1 17.2 After some general discussion, this chapter presents most of the more

elementary

**queueing**models and their basic results. Chapter 18 discusses howthe information provided by

**queueing**theory can be used to design**queueing**...Page 890

This chapter presented the most basic models of

particularly useful results are available. However, many other interesting models

could be considered if space permitted. In fact, several thousand research papers

...

This chapter presented the most basic models of

**queueing**theory for whichparticularly useful results are available. However, many other interesting models

could be considered if space permitted. In fact, several thousand research papers

...

Page 924

An OR team then applied

service requirements. This resulted in replacing the previous one. person tech

rep territories by larger three-person tech rep territories. This change had th:

dramatic ...

An OR team then applied

**queueing**theory to study how it best meet the newservice requirements. This resulted in replacing the previous one. person tech

rep territories by larger three-person tech rep territories. This change had th:

dramatic ...

### 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 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 waiting weeks