2004
DOI: 10.1080/09511920310001607096
|View full text |Cite
|
Sign up to set email alerts
|

State space representation of manufacturing operation plans in the presence of flexible routing capability

Abstract: Manufacturing process planning in flexible manufacturing environments requires a highly efficient computerized representation, since the number of different alternatives grows rapidly as the level of flexibility of the manufacturing systems increases. Furthermore, in order to recommend a good manufacturing plan, it is necessary to be capable of generating all feasible alternatives. This paper describes a state space to represent manufacturing operation plans, which generates a compact representation of all pos… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2009
2009
2014
2014

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 26 publications
0
3
0
Order By: Relevance
“…We note that by following the definitions in binary tree representation, we relate nodes to operations and arcs operations precedence. In other modeling/representation tools pertaining to manufacturing/assembly processes, such as AND/OR graphs (Benjaafar and Ramakrishnan, 1996;Homem de Mello and Sanderson, 1990), directed acyclic graphs (Borenstein, 2000) and state transition graphs (Borenstein and Becker, 2004), nodes and arcs are defined in a similar way. In general, two types of nodes can be identified: l-nodes and i-nodes.…”
Section: Problem Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…We note that by following the definitions in binary tree representation, we relate nodes to operations and arcs operations precedence. In other modeling/representation tools pertaining to manufacturing/assembly processes, such as AND/OR graphs (Benjaafar and Ramakrishnan, 1996;Homem de Mello and Sanderson, 1990), directed acyclic graphs (Borenstein, 2000) and state transition graphs (Borenstein and Becker, 2004), nodes and arcs are defined in a similar way. In general, two types of nodes can be identified: l-nodes and i-nodes.…”
Section: Problem Formulationmentioning
confidence: 99%
“…Following Zheng et al (2008), Borenstein and Becker (2004) and others, we have taken a product to relate to a single production process. However, we note that based on a generic process, multiple processes can be planned for a given product in the corresponding family.…”
Section: An Industrial Examplementioning
confidence: 99%
“…However, most of the existing literature dealing with routing flexibility has primarily been devoted to the push-type production systems. A state space was described to represent manufacturing operation plans, which generates a compact representation of all possible manufacturing operation sequences and routings that can be applied to a certain part [21]. Although extensive research has been conducted on design and operational problems of automated manufacturing systems, many problems remain unsolved.…”
Section: Introductionmentioning
confidence: 99%