Add Papers Marked0
Paper checked off!

Marked works

Viewed0

Viewed works

Shopping Cart0
Paper added to shopping cart!

Shopping Cart

Register Now

internet library
Atlants.lv library
FAQ
5,49 € Add to cart
Add to Wish List
Want cheaper?
ID number:616142
Evaluation:
Published: 15.06.2011.
Language: English
Level: Secondary school
Literature: 3 units
References: Not used
Table of contents
Nr. Chapter  Page.
  Introduction    3
  Definitions of OM, what it is and what can be    4
  A Cross Functional Perspective. The help of IT    5
  A process perspective’s role in developments    6
  Processes across and within other functional areas    9
  The reductionistic and holistic approach applied to Operations Management    9
  Focus Improvement instead of optimization    10
  Practitioners    13
  Conclusion    13
  Bibliography    13
Extract

Conclusion
Correct determination of design variable, functional, and criteria constraints is a major challenge in real-life optimization problems. The most promising solution approach involves two stages. In the first stage, the feasible solution and Pareto optimal sets are constructed and analyzed. These sets are constructed on the basis of the PSI method. Analysis of the feasible solution set shows the work of all constraints; the cost of making concessions in various constraints, i.e. what are the losses and the gains; expediency of modification of constraints; and resources for improvement of the object by all criteria. Only after the first stage one can make a decision as to whether it is necessary to improve the obtained results by means of various optimization methods, including stochastic, genetic.

Let see another example with not that much mathematical base.
Combinatorial optimization problems occur in a variety of fields including scheduling, routing, design layout, engineering disciplines, management and econometrics. Solutions to these problems are characterized by identifying an optimum combination of individual choice selections from among a multitude of possibilities. Examples of such enumerative search, graph search, or combinatorial optimization problems include moves in board games such as chess or go, determining how articles of different sizes can be packed in containers of limited capacity, determining optimum scheduling of operations in a manufacturing process, and capacitated vehicle routing with time windows.
Enumerative search, or combinatorial optimization problems is a Ill established field, for example, see Aho et al. in "Data Structures & Algorithms,"
In the prior art, the time required to solve combinatorial optimization problems has been reduced by using efficient heuristic methods that are not guaranteed to find an optimal solution, but one that is near optimal.

Author's comment
Work pack:
GREAT DEAL buying in a pack your savings −7,98 €
Work pack Nr. 1315984
Load more similar papers

Atlants

Choose Authorization Method

Email & Password

Email & Password

Wrong e-mail adress or password!
Log In

Forgot your password?

Draugiem.pase
Facebook
Twitter

Not registered yet?

Register and redeem free papers!

To receive free papers from Atlants.com it is necessary to register. It's quick and will only take a few seconds.

If you have already registered, simply to access the free content.

Cancel Register