### Abstract

In an automated assembly system, a product is completed through a series of assembly operations according to a predefined sequence. Partially assembled components are automatically transported from one machine to another machine until the final product is organized. This paper describes a method for finding optimal assembly sequences in an assembly system. All feasible assembly sequences can be represented by an AND/OR graph which provides all feasible geometric configurations and relationships among the components of a product. The AND/OR graph is converted into a Petri net which can be formulated as a linear program with the objective of minimizing the total assembly time or cost. A dynamic programming algorithm is developed to find the optimal sequences from the Petri net since too much computational effort is required to obtain the optimal solution of the linear program by utilizing the simplex method and interior point methods. The algorithm has the computational complexity of O(nm), where n and m denote the number of assembly operations and base components, respectively, and it is more efficient than the former methods. Three assembly products are provided to validate the algorithm.

Original language | English (US) |
---|---|

Pages (from-to) | 27-37 |

Number of pages | 11 |

Journal | International Journal of Industrial Engineering : Theory Applications and Practice |

Volume | 6 |

Issue number | 1 |

State | Published - Mar 1 1999 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Industrial and Manufacturing Engineering

### Cite this

}

*International Journal of Industrial Engineering : Theory Applications and Practice*, vol. 6, no. 1, pp. 27-37.

**Dynamic programming algorithm to determine optimal assembly sequences using Petri nets.** / Yee, Shang Tae; Ventura, Jose Antonio.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Dynamic programming algorithm to determine optimal assembly sequences using Petri nets

AU - Yee, Shang Tae

AU - Ventura, Jose Antonio

PY - 1999/3/1

Y1 - 1999/3/1

N2 - In an automated assembly system, a product is completed through a series of assembly operations according to a predefined sequence. Partially assembled components are automatically transported from one machine to another machine until the final product is organized. This paper describes a method for finding optimal assembly sequences in an assembly system. All feasible assembly sequences can be represented by an AND/OR graph which provides all feasible geometric configurations and relationships among the components of a product. The AND/OR graph is converted into a Petri net which can be formulated as a linear program with the objective of minimizing the total assembly time or cost. A dynamic programming algorithm is developed to find the optimal sequences from the Petri net since too much computational effort is required to obtain the optimal solution of the linear program by utilizing the simplex method and interior point methods. The algorithm has the computational complexity of O(nm), where n and m denote the number of assembly operations and base components, respectively, and it is more efficient than the former methods. Three assembly products are provided to validate the algorithm.

AB - In an automated assembly system, a product is completed through a series of assembly operations according to a predefined sequence. Partially assembled components are automatically transported from one machine to another machine until the final product is organized. This paper describes a method for finding optimal assembly sequences in an assembly system. All feasible assembly sequences can be represented by an AND/OR graph which provides all feasible geometric configurations and relationships among the components of a product. The AND/OR graph is converted into a Petri net which can be formulated as a linear program with the objective of minimizing the total assembly time or cost. A dynamic programming algorithm is developed to find the optimal sequences from the Petri net since too much computational effort is required to obtain the optimal solution of the linear program by utilizing the simplex method and interior point methods. The algorithm has the computational complexity of O(nm), where n and m denote the number of assembly operations and base components, respectively, and it is more efficient than the former methods. Three assembly products are provided to validate the algorithm.

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

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

M3 - Article

AN - SCOPUS:0032670716

VL - 6

SP - 27

EP - 37

JO - International Journal of Industrial Engineering : Theory Applications and Practice

JF - International Journal of Industrial Engineering : Theory Applications and Practice

SN - 1072-4761

IS - 1

ER -