Least cost tolerance allocation and bicriteria extension

Chae Bogk Kim, P. Simin Pulat, Bobbie L. Foote, Dong Hoon Lee

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)418-426
Number of pages9
JournalInternational Journal of Computer Integrated Manufacturing
Volume12
Issue number5
Publication statusPublished - 1999 Sep 1

Fingerprint

Costs
Heuristic algorithms
Tolerance
Bicriteria
Allocation problem
Decision maker
Heuristic algorithm
Burden

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

Least cost tolerance allocation and bicriteria extension. / Kim, Chae Bogk; Pulat, P. Simin; Foote, Bobbie L.; Lee, Dong Hoon.

In: International Journal of Computer Integrated Manufacturing, Vol. 12, No. 5, 01.09.1999, p. 418-426.

Research output: Contribution to journalArticle

Kim, Chae Bogk ; Pulat, P. Simin ; Foote, Bobbie L. ; Lee, Dong Hoon. / Least cost tolerance allocation and bicriteria extension. In: International Journal of Computer Integrated Manufacturing. 1999 ; Vol. 12, No. 5. pp. 418-426.
@article{22467abab18a49e7883ebb4d1a24870c,
title = "Least cost tolerance allocation and bicriteria extension",
abstract = "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.",
author = "Kim, {Chae Bogk} and Pulat, {P. Simin} and Foote, {Bobbie L.} and Lee, {Dong Hoon}",
year = "1999",
month = "9",
day = "1",
language = "English",
volume = "12",
pages = "418--426",
journal = "International Journal of Computer Integrated Manufacturing",
issn = "0951-192X",
publisher = "Taylor and Francis Ltd.",
number = "5",

}

TY - JOUR

T1 - Least cost tolerance allocation and bicriteria extension

AU - Kim, Chae Bogk

AU - Pulat, P. Simin

AU - Foote, Bobbie L.

AU - Lee, Dong Hoon

PY - 1999/9/1

Y1 - 1999/9/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0010099228&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0010099228&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0010099228

VL - 12

SP - 418

EP - 426

JO - International Journal of Computer Integrated Manufacturing

JF - International Journal of Computer Integrated Manufacturing

SN - 0951-192X

IS - 5

ER -