enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Economic order quantity - Wikipedia

    en.wikipedia.org/wiki/Economic_order_quantity

    Economic order quantity. Economic order quantity ( EOQ ), also known as financial purchase quantity or economic buying quantity, [citation needed] is the order quantity that minimizes the total holding costs and ordering costs in inventory management. It is one of the oldest classical production scheduling models.

  3. Knapsack problem - Wikipedia

    en.wikipedia.org/wiki/Knapsack_problem

    Definition[edit] The most common problem being solved is the 0-1 knapsack problem, which restricts the number of copies of each kind of item to zero or one. Given a set of items numbered from 1 up to , each with a weight and a value , along with a maximum weight capacity , maximize. subject to and . Here represents the number of instances of ...

  4. Cutting stock problem - Wikipedia

    en.wikipedia.org/wiki/Cutting_stock_problem

    The minimum pattern count problem: to find a minimum-pattern-count solution amongst the minimum-waste solutions. This is a very hard problem, even when the waste is known. There is a conjecture that any equality-constrained one-dimensional instance with n sizes has at least one minimum waste solution with no more than n + 1 patterns. This ...

  5. Economic production quantity - Wikipedia

    en.wikipedia.org/wiki/Economic_production_quantity

    The economic production quantity model (also known as the EPQ model) determines the quantity a company or retailer should order to minimize the total inventory costs by balancing the inventory holding cost and average fixed ordering cost. The EPQ model was developed and published by E. W. Taft, a statistical engineer working at Winchester ...

  6. Bin packing problem - Wikipedia

    en.wikipedia.org/wiki/Bin_packing_problem

    Computationally, the problem is NP-hard, and the corresponding decision problem, deciding if items can fit into a specified number of bins, is NP-complete. Despite its worst-case hardness, optimal solutions to very large instances of the problem can be produced with sophisticated algorithms. In addition, many approximation algorithms exist.

  7. Minimum-cost flow problem - Wikipedia

    en.wikipedia.org/wiki/Minimum-cost_flow_problem

    Minimum-cost flow problem. The minimum-cost flow problem ( MCFP) is an optimization and decision problem to find the cheapest possible way of sending a certain amount of flow through a flow network. A typical application of this problem involves finding the best delivery route from a factory to a warehouse where the road network has some ...

  8. Inventory theory - Wikipedia

    en.wikipedia.org/wiki/Inventory_theory

    The inventory control problem is the problem faced by a firm that must decide how much to order in each time period to meet demand for its products. The problem can be modeled using mathematical techniques of optimal control, dynamic programming and network optimization. The study of such models is part of inventory theory.

  9. Material requirements planning - Wikipedia

    en.wikipedia.org/wiki/Material_requirements_planning

    Material requirements planning. Material requirements planning ( MRP) is a production planning, scheduling, and inventory control system used to manage manufacturing processes. Most MRP systems are software -based, but it is possible to conduct MRP by hand as well. An MRP system is intended to simultaneously meet three objectives: