• 제목/요약/키워드: multi-objective part-machine grouping problem

검색결과 3건 처리시간 0.019초

대단위 부품-기계 군집 문제를 위한 Look-ahead 휴리스틱 알고리듬 (A Look-ahead Heuristic Algorithm for Large-scale Part-Machine Grouping Problems)

  • 백종관;백준걸;김창욱
    • 한국경영과학회지
    • /
    • 제30권3호
    • /
    • pp.41-54
    • /
    • 2005
  • In this paper, we consider a multi-objective machine cell formation problem. This problem Is characterized as determining part route families and machine cells such that total sum of inter-ceil part movements and maximum machine workload imbalance are simultaneously minimized. Together with the objective function, alternative part routes and the machine sequences of part routes are considered In grouping Part route families. Due to the complexity of the problem, a two-phase heuristic algorithm is proposed. And we developed an n-stage look-ahead heuristic algorithm that generalizes the roll-out algorithm. Computational experiments were conducted to verify the performance of the algorithm.

대체가공경로와 가공순서를 고려한 부품-기계 군집 알고리듬 (A Part-Machine Grouping Algorithm Considering Alternative Part Routings and Operation Sequences)

  • 백준걸;백종관;김창욱
    • 대한산업공학회지
    • /
    • 제29권3호
    • /
    • pp.213-221
    • /
    • 2003
  • In this paper, we consider a multi-objective part-machine grouping problem, in which part types have several alternative part routings and each part routing has a machining sequence. This problem is characterized as optimally determining part type sets and its corresponding machine cells such that the sum of inter-cell part movements and the sum of machine workload imbalances are simultaneously minimized. Due to the complexity of the problem, a two-stage heuristic algorithm is proposed, and experiments are shown to verify the effectiveness of the algorithm.

대체가공경로를 가지는 부품-기계 군집 문제를 위한 일반화된 군집 알고리듬 (Generalized Clustering Algorithm for Part-Machine Grouping with Alternative Process Plans)

  • 김창욱;박윤선;전진
    • 대한산업공학회지
    • /
    • 제27권3호
    • /
    • pp.281-288
    • /
    • 2001
  • We consider in this article a multi-objective part-machine grouping problem in which parts have alternative process plans and expected annual demand of each part is known. This problem is characterized as optimally determining part sets and corresponding machine cells such that total sum of distance (or dissimilarity) between parts and total sum of load differences between machines are simultaneously minimized. Two heuristic algorithms are proposed, and examples are given to compare the performance of the algorithms.

  • PDF