Big Chemical Encyclopedia

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

Articles Figures Tables About

The Aggregate Planning Problem

The objective of the aggregate plan is to satisfy danand in a way that maximizes profit for the firm. We can state the aggregate planning problan formally as follows  [Pg.211]

Given the demand forecast for each period in the planning horizon, determine the production level, inventory level, capacity level (intemal and outsourced), and any backlogs (unmet demand) for each period that maximize the firm s profit over the planning horizon. [Pg.211]

Using this information, a company makes the following determinations through aggregate planning  [Pg.212]

Production quantity from regular time, overtime, and subcontracted time used to determine number of workers and supplier purchase levels [Pg.212]

Inventory held used to determine the warehouse space and working capital required Backlog/stockout quantity used to determine customer service levels Workforce hired/laid off used to determine any labor issues likely to be encountered [Pg.212]


In the remaining sections of this chapter, we will discuss the aggregate planning problem and quantitative methods for its solution. [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]

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]

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]

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

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]

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]

In the next section, we formally define the aggregate plarming problem. We specily the information required for aggregate planning and discuss the decision outcomes that aggregate planning can provide. [Pg.211]

Similar to SC planning problems, the elements of simulation models (i.e. flows, processors, and environmental variables) can be structured according to the level of detail involved. Based on the basic structure of a chemical SC as depicted in Figure 4.10, three aggregation levels are distinguished ... [Pg.161]

One of the basic problems that exists in business today is the issue of imeven demand As a result of this, processes need to be put in place that will minimize the costs involved in leveling the demand and effectively using the available capacity. This is the goal of aggregate planning. In the area of operations management, you will find models and simulations that can be run to help optimize this process. [Pg.50]

Capacity planning verifies the feasibility of the plans at both aggregate and detailed levels. At first stage, master production schedule feasibility can be verified in an aggregated way. After material planning is performed, capacity planning verification may induce adjustments in the detailed plans. Also, the master production schedule can be modified if capacity planning reveals feasibility problems. [Pg.1005]

The SC strategic level determines the sourcing, manufacturing, and distribution network to serve the marketplace. Due to its nature, the network design problem is typically solved every two to five years (Graves and Willems 2003). The strategic plan is developed at an aggregated level of time, products, and resources. [Pg.18]


See other pages where The Aggregate Planning Problem is mentioned: [Pg.65]    [Pg.77]    [Pg.211]    [Pg.225]    [Pg.65]    [Pg.77]    [Pg.211]    [Pg.225]    [Pg.112]    [Pg.112]    [Pg.129]    [Pg.71]    [Pg.76]    [Pg.314]    [Pg.209]    [Pg.211]    [Pg.227]    [Pg.116]    [Pg.219]    [Pg.242]    [Pg.250]    [Pg.244]    [Pg.135]    [Pg.138]    [Pg.22]    [Pg.58]    [Pg.477]    [Pg.22]    [Pg.792]    [Pg.126]    [Pg.1003]    [Pg.728]    [Pg.18]    [Pg.1107]    [Pg.290]    [Pg.210]    [Pg.20]   


SEARCH



Aggregate planning

The plan

© 2024 chempedia.info