Durchschnittlicher Fortschritt
Empfohlene Karteikarten-Sets
Karteikarten im Karteikarten-Set
Noch nicht gestartet (8)
a) Linear programs with up to three variables can be solved graphically.
b) Linear programs with up to 200 variables can be solved using Excel Solver.
c) George Dantzig realized that a lot of problems in industry, business and military could be described through linear equations and inequalities.
d) A linear program can have at most one constraint.
e) When solving a linear program graphically, the first step is to draw the objective function.
b) Linear programs with up to 200 variables can be solved using Excel Solver.
c) George Dantzig realized that a lot of problems in industry, business and military could be described through linear equations and inequalities.
d) A linear program can have at most one constraint.
e) When solving a linear program graphically, the first step is to draw the objective function.
b) c)
a) b) c)
a) Using chase strategy, the production rate is kept constant.
b) One disadvantage of the level strategy is the cost of adjusting output rates and workforce levels.
c) Aggregate planning focuses on groups of similar goods and services.
d) Capacity strategies involve changing capacities such that demand can be met.
e) The master production schedule is followed by aggregate planning.
b) One disadvantage of the level strategy is the cost of adjusting output rates and workforce levels.
c) Aggregate planning focuses on groups of similar goods and services.
d) Capacity strategies involve changing capacities such that demand can be met.
e) The master production schedule is followed by aggregate planning.
c) d)
a) Aggregate planning focuses on long-term planning of the production, where choices on capacities are being made.
b) Aggregate planning can be done using trial-and-error.
c) The aim of aggregate planning is to minimize the costs for the entire planning horizon and cover the forecasted demand.
d) In aggregate planning, the planning is done, for example, for product groups per month.
e) Master scheduling is completely detached from lot sizing.
b) Aggregate planning can be done using trial-and-error.
c) The aim of aggregate planning is to minimize the costs for the entire planning horizon and cover the forecasted demand.
d) In aggregate planning, the planning is done, for example, for product groups per month.
e) Master scheduling is completely detached from lot sizing.
b) c) d)
a) Material requirements planning is a methodology generally used in production planning for assembled products.
b) The silver-meal heuristic is only used for single-period lot-sizing decisions.
c) The lot size is the order quantity that is to produced or ordered.
d) In the newsvendor problem, the order quantity is calculated first, afterwards costs for shortage and excess are evaluated.
e) The critical ratio is interpreted as the optimal service level.
b) The silver-meal heuristic is only used for single-period lot-sizing decisions.
c) The lot size is the order quantity that is to produced or ordered.
d) In the newsvendor problem, the order quantity is calculated first, afterwards costs for shortage and excess are evaluated.
e) The critical ratio is interpreted as the optimal service level.
a) c) e)
a) The material requirements planning is followed by the master production schedule.
b) The economic order quantity formula can be used to identify a fixed lot size that minimizes the total annual costs.
c) The ABC-approach helps to distinguish between "important" and less important customers.
d) The economic order quantity formula is used to calculate the optimal order quantity of a product with fluctuating demand.
e) One assumption for the Silver-Meal heuristic is that demand is stochastic.
b) The economic order quantity formula can be used to identify a fixed lot size that minimizes the total annual costs.
c) The ABC-approach helps to distinguish between "important" and less important customers.
d) The economic order quantity formula is used to calculate the optimal order quantity of a product with fluctuating demand.
e) One assumption for the Silver-Meal heuristic is that demand is stochastic.
b) c)
a) Scheduling is used for example in sequencing and surgery room planning.
b) A solution obtained using the EDD rule is optimal for the goal of minimizing the average flow time.
c) The critical path through the network does not contain any slack.
d) The completion time is the duration between the release of a job and the time of its completion.
e) Job Shop means that all n jobs have to be processed on all m machines in the same order. Each job is processed only once on each machine.
b) A solution obtained using the EDD rule is optimal for the goal of minimizing the average flow time.
c) The critical path through the network does not contain any slack.
d) The completion time is the duration between the release of a job and the time of its completion.
e) Job Shop means that all n jobs have to be processed on all m machines in the same order. Each job is processed only once on each machine.
a) c)
a) Solving the Steiner-Weber problem, the best coordinates for a new location are calculated.
b) For solving the p-median problem, a smaller set of p locations is chosen out of a larger set of possible locations.
c) Using the Center of gravity method, the weighted euclidean distances are minimized.
d) Bad location decisions can lead to high transportation costs and lack of resource availability.
e)The column-minima method is an exact method.
b) For solving the p-median problem, a smaller set of p locations is chosen out of a larger set of possible locations.
c) Using the Center of gravity method, the weighted euclidean distances are minimized.
d) Bad location decisions can lead to high transportation costs and lack of resource availability.
e)The column-minima method is an exact method.
a) b) d)