Line balancing methods - heuristic approach, Operation Research

Assignment Help:

Line Balancing Methods - Heuristic Approach

 Heuristic mean serving to find i.e. to find out discover things for oneself. Heuristic describes a particular approach to problem solving decision making and control. Heuristics are often simple thumb rules which are employed to solve complex problems. They aim to provide ways to solve problems which at the beginning of an investigation elude rigours logical analysis. Heuristic models utilize common sense logic and above all past experience to tackle the new problems. Heuristics methods though have little if any theoretical foundations yet they provide most likely ( and if not the optimum) solutions which are good enough from a practical point of view.

Heuristic methods break down a complex problem into smaller and easily manageable sub problems. Then from the past experience of tacking different but similarly structured problems the promising solution for each sub most problem ( of new situation) is determined. Heuristic approach has advantages of consistency, speed and ability to cope with more data and larger systems.


Related Discussions:- Line balancing methods - heuristic approach

Strategies and od intervention techniques, QUESTION 1 Change strategies...

QUESTION 1 Change strategies and OD intervention techniques follow from diagnosis. An inappropriate intervention due to a faulty diagnosis may be very costly to an organization

Books - report writing presentation , Books a. One author : Authors...

Books a. One author : Authors  last name  first name title  of books place of publication: publisher copyright data page numbers used. b. Two Author : First  author  la

Model, disadvantages of model in operational research

disadvantages of model in operational research

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 0

Linear programming problem, Solve the following Linear Programming Problem ...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Inherent forces fomenting conflicts of interest, Inherent forces fomenting ...

Inherent forces fomenting conflicts of interest Several forces have coalesced to increase the incidence of conflicts of interest in the medical industry: the vertical integrat

Draw a network for the project adn determine the critical pa, a)Draw a netw...

a)Draw a network for the project. b)Determine the critical path. Activity Duration Activity Duration 1-2 15 5-10 22 1-3 13 6-9 33 1-4 1

Linear programing problems, basic requirements for solving linear programin...

basic requirements for solving linear programing using simplex method

Scope., what is the scope of operational research in india ? explain with t...

what is the scope of operational research in india ? explain with the job names.

Lpp, a paper mill prodecs two grades of paper viz., X and Y. Because of raw...

a paper mill prodecs two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper in

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd