Pievienot darbus Atzīmētie0
Darbs ir veiksmīgi atzīmēts!

Atzīmētie darbi


Skatītie darbi

Darbs ir sekmīgi pievienots grozam!



interneta bibliotēka
Atlants.lv bibliotēka

Izdevīgi: šodien akcijas cena!

Parastā cena:
0,71 (13%)
Cena ar atlaidi*:
Publicēts: 15.06.2011.
Valoda: Angļu
Līmenis: Vidusskolas
Literatūras saraksts: 3 vienības
Atsauces: Nav
Nr. Sadaļas nosaukums  Lpp.
  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
Darba fragmentsAizvērt

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.

Autora komentārsAtvērt
Darbu komplekts:
IZDEVĪGI pirkt komplektā ietaupīsi −6,62 €
Materiālu komplekts Nr. 1315984
Parādīt vairāk līdzīgos ...

Nosūtīt darbu e-pastā

Tavs vārds:

E-pasta adrese, uz kuru nosūtīt darba saiti:

{Tavs vārds} iesaka Tev apskatīties interneta bibliotēkas Atlants.lv darbu par tēmu „Process Management Instead of Operations Management”.

Saite uz darbu:


E-pasts ir nosūtīts.

Izvēlies autorizēšanās veidu

E-pasts + parole

E-pasts + parole

Norādīta nepareiza e-pasta adrese vai parole!

Aizmirsi paroli?


Neesi reģistrējies?

Reģistrējies un saņem bez maksas!

Lai saņemtu bezmaksas darbus no Atlants.lv, ir nepieciešams reģistrēties. Tas ir vienkārši un aizņems vien dažas sekundes.

Ja Tu jau esi reģistrējies, vari vienkārši un varēsi saņemt bezmaksas darbus.

Atcelt Reģistrēties