Process planning by retrieval and adaptation

A. Márkus, J. Váncza, M. Horváth

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

The paper describes new developments in a feature-based process planning system. Extensions are discussed toward a framework where planning is accomplished via retrieving and adapting previous, part family-related plans. Our primary concern here are the prerequisites to the re-use of plans: the assessment of similarities of parts, and the matching of their feature-based descriptions. Contrary to the traditional approaches, we define a new notion of part similarity that is based on the morphology of the precedence graphs over the parts' feature states. Procedures that support the matching of features of different parts by relying mainly on this ordering information are given, and a running example explains how they actually work.

Original languageEnglish
Pages (from-to)47-60
Number of pages14
JournalComputers in Industry
Volume33
Issue number1
Publication statusPublished - Aug 1997

Fingerprint

Process planning
Planning
Graph
Reuse

Keywords

  • Computer-aided process planning
  • Operation ordering
  • Plan adaptation

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

Márkus, A., Váncza, J., & Horváth, M. (1997). Process planning by retrieval and adaptation. Computers in Industry, 33(1), 47-60.

Process planning by retrieval and adaptation. / Márkus, A.; Váncza, J.; Horváth, M.

In: Computers in Industry, Vol. 33, No. 1, 08.1997, p. 47-60.

Research output: Contribution to journalArticle

Márkus, A, Váncza, J & Horváth, M 1997, 'Process planning by retrieval and adaptation', Computers in Industry, vol. 33, no. 1, pp. 47-60.
Márkus, A. ; Váncza, J. ; Horváth, M. / Process planning by retrieval and adaptation. In: Computers in Industry. 1997 ; Vol. 33, No. 1. pp. 47-60.
@article{8f8f056c8bd94e98ba5a2eccfbf9d256,
title = "Process planning by retrieval and adaptation",
abstract = "The paper describes new developments in a feature-based process planning system. Extensions are discussed toward a framework where planning is accomplished via retrieving and adapting previous, part family-related plans. Our primary concern here are the prerequisites to the re-use of plans: the assessment of similarities of parts, and the matching of their feature-based descriptions. Contrary to the traditional approaches, we define a new notion of part similarity that is based on the morphology of the precedence graphs over the parts' feature states. Procedures that support the matching of features of different parts by relying mainly on this ordering information are given, and a running example explains how they actually work.",
keywords = "Computer-aided process planning, Operation ordering, Plan adaptation",
author = "A. M{\'a}rkus and J. V{\'a}ncza and M. Horv{\'a}th",
year = "1997",
month = "8",
language = "English",
volume = "33",
pages = "47--60",
journal = "Computers in Industry",
issn = "0166-3615",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Process planning by retrieval and adaptation

AU - Márkus, A.

AU - Váncza, J.

AU - Horváth, M.

PY - 1997/8

Y1 - 1997/8

N2 - The paper describes new developments in a feature-based process planning system. Extensions are discussed toward a framework where planning is accomplished via retrieving and adapting previous, part family-related plans. Our primary concern here are the prerequisites to the re-use of plans: the assessment of similarities of parts, and the matching of their feature-based descriptions. Contrary to the traditional approaches, we define a new notion of part similarity that is based on the morphology of the precedence graphs over the parts' feature states. Procedures that support the matching of features of different parts by relying mainly on this ordering information are given, and a running example explains how they actually work.

AB - The paper describes new developments in a feature-based process planning system. Extensions are discussed toward a framework where planning is accomplished via retrieving and adapting previous, part family-related plans. Our primary concern here are the prerequisites to the re-use of plans: the assessment of similarities of parts, and the matching of their feature-based descriptions. Contrary to the traditional approaches, we define a new notion of part similarity that is based on the morphology of the precedence graphs over the parts' feature states. Procedures that support the matching of features of different parts by relying mainly on this ordering information are given, and a running example explains how they actually work.

KW - Computer-aided process planning

KW - Operation ordering

KW - Plan adaptation

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

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

M3 - Article

AN - SCOPUS:0031197873

VL - 33

SP - 47

EP - 60

JO - Computers in Industry

JF - Computers in Industry

SN - 0166-3615

IS - 1

ER -