Skip to main content
padlock icon - secure page this page is secure

Least cost tolerance allocation and bicriteria extension

Buy Article:

$61.00 + tax (Refund Policy)

Due to the combinatorial scheme, the least cost tolerance allocation problem is an NP class problem. There have therefore been many studies into how to reduce the computational burden to solve the problem. However, in the practical situation, reducing both cost and tolerance is an interesting area for the decision maker (designer). In this paper, a simple and effective heuristic algorithm for the problem is presented to generate efficient solutions with respect to cost and tolerance. When there is no total assembly tolerance constraint, the proposed algorithm can find all efficient solutions of a bicriteria tolerance allocation problem. In order to test the performance of the presented algorithm, eight examples are taken from Chase et al. (1990). According to the computational results, the algorithm finds all efficient solutions of each example in a few seconds.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Document Type: Research Article

Publication date: September 1, 1999

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more