Aggregate planning problem

In the remaining sections of this chapter, we will discuss the aggregate planning problem and quantitative methods for its solution. [Pg.64]

Aggregation refers to the idea of focusing on overall capacity, rather than individual products or services. Aggregation is done according to [Pg.64]

Aggregate planning problem The aggregate planning problem can be stated as follows [Pg.64]

The aggregate planning problem is basically a medium range tactical supply chain problem. There are primarily three aggregate planning strategies a company can follow. [Pg.64]

The LP model, illustrated in Section 2.15, can be extended to solve a more general aggregate planning problem. For the development of the general model, we use the following notations ... [Pg.70]

Transportation problems represent a special class of LP problems that are easier to solve. In this section, we shall discuss the basics of a transportation model, how aggregate planning problems can be formulated as transportation problems, and a "greedy" algorithm to solve special cases of aggregate planning problems by inspection. [Pg.72]

Before we discuss the general model, we use an example to illustrate how certain aggregate planning problems can be formulated as transportation problems. [Pg.75]

We shall now discuss a general transportation model that allows for both inventory and shortages in aggregate planning problems. [Pg.76]

Shortages are allowed but all backlogs must be filled by the Tth period. The aggregate planning problem is to determine the optimal production plan that minimizes the total cost of production, inventory, and shortage. [Pg.77]

In order to formulate the aggregate planning problem as a transportation problem, we do the following ... [Pg.77]

Consider the aggregate planning problem given in Example 2.14, where no shortages are allowed and weekly demands must be satisfied at all times. Solve the transportation problem using the greedy algorithm. [Pg.78]

Under what assumptions an aggregate planning problem can be formulated as a transportation model What additional assumptions are needed to solve the transportation model by the greedy algorithm ... [Pg.86]

Consider the aggregate planning problem discussed in Example 2.13 (Section 2.15). Discuss how the LP formulation will change if the following constraints are added. [Pg.88]

Formulate and solve basic aggregate planning problems using Microsoft Excel. [Pg.209]

How does the availability of subcontracting affect the aggregate planning problem ... [Pg.227]

Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...