A constraint engine for manufacturing process planning

J. Váncza, Andràs Màrkus

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

We present a constraint-based model and planning engine for manufacturing process planning. By exploiting the expressive power of constraint programming (CP), all relevant, sometimes conflicting pieces of domain knowledge are represented. The planner applies standard propagation techniques and customized search to find cost-optimal solutions in presence of hard, soft and conditional constraints. The planning engine was built on an existing general-purpose CP system and was validated in the domains of machining and of sheet metal bending.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages745-759
Number of pages15
Volume2239
ISBN (Print)3540428631, 9783540428633
Publication statusPublished - 2001
Event7th International Conference on Principles and Practice of Constraint Programming, CP 2001 - Paphos, Cyprus
Duration: Nov 26 2001Dec 1 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2239
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other7th International Conference on Principles and Practice of Constraint Programming, CP 2001
CountryCyprus
CityPaphos
Period11/26/0112/1/01

Fingerprint

Process Planning
Constraint Programming
Process planning
Engine
Manufacturing
Planning
Engines
Computer systems programming
Sheet Metal
Expressive Power
Domain Knowledge
Sheet metal
Machining
Optimal Solution
Propagation
Costs
Model
Standards

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Váncza, J., & Màrkus, A. (2001). A constraint engine for manufacturing process planning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2239, pp. 745-759). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2239). Springer Verlag.

A constraint engine for manufacturing process planning. / Váncza, J.; Màrkus, Andràs.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2239 Springer Verlag, 2001. p. 745-759 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2239).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Váncza, J & Màrkus, A 2001, A constraint engine for manufacturing process planning. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2239, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2239, Springer Verlag, pp. 745-759, 7th International Conference on Principles and Practice of Constraint Programming, CP 2001, Paphos, Cyprus, 11/26/01.
Váncza J, Màrkus A. A constraint engine for manufacturing process planning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2239. Springer Verlag. 2001. p. 745-759. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Váncza, J. ; Màrkus, Andràs. / A constraint engine for manufacturing process planning. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2239 Springer Verlag, 2001. pp. 745-759 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ef970433063842e3a20b8e96febd7a33,
title = "A constraint engine for manufacturing process planning",
abstract = "We present a constraint-based model and planning engine for manufacturing process planning. By exploiting the expressive power of constraint programming (CP), all relevant, sometimes conflicting pieces of domain knowledge are represented. The planner applies standard propagation techniques and customized search to find cost-optimal solutions in presence of hard, soft and conditional constraints. The planning engine was built on an existing general-purpose CP system and was validated in the domains of machining and of sheet metal bending.",
author = "J. V{\'a}ncza and Andr{\`a}s M{\`a}rkus",
year = "2001",
language = "English",
isbn = "3540428631",
volume = "2239",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "745--759",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A constraint engine for manufacturing process planning

AU - Váncza, J.

AU - Màrkus, Andràs

PY - 2001

Y1 - 2001

N2 - We present a constraint-based model and planning engine for manufacturing process planning. By exploiting the expressive power of constraint programming (CP), all relevant, sometimes conflicting pieces of domain knowledge are represented. The planner applies standard propagation techniques and customized search to find cost-optimal solutions in presence of hard, soft and conditional constraints. The planning engine was built on an existing general-purpose CP system and was validated in the domains of machining and of sheet metal bending.

AB - We present a constraint-based model and planning engine for manufacturing process planning. By exploiting the expressive power of constraint programming (CP), all relevant, sometimes conflicting pieces of domain knowledge are represented. The planner applies standard propagation techniques and customized search to find cost-optimal solutions in presence of hard, soft and conditional constraints. The planning engine was built on an existing general-purpose CP system and was validated in the domains of machining and of sheet metal bending.

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

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

M3 - Conference contribution

AN - SCOPUS:84947903309

SN - 3540428631

SN - 9783540428633

VL - 2239

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 745

EP - 759

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -