Download:
|
by Michael H. Goldwasser, Rajeev Motwani
http://www.cs.princeton.edu/~wass/publications/IJCGA99.ps.gz
Add To MetaCart
Abstract:
Our work focuses on various complexity measures for two-handed assembly sequences. For many products, there exist an exponentially large set of valid sequences, and a natural goal is to use automated systems to select wisely from the choices. Although there has been a great deal of algorithmic success for finding feasible assembly sequences, there has been very little success towards optimizing the costs of sequences. We attempt to explain this lack of progress, by proving the inherent di#culty in finding optimal, or even near-optimal, assembly sequences. To begin, we define, "virtual assembly sequencing, " a graph-theoretic problem that is a generalization of assembly sequencing, focusing on the combinatorial aspect of the family of feasible assembly sequences while temporarily separating out the specific geometric assumptions inherent to assembly sequencing. We formally prove the hardness of finding even near-optimal sequences for most cost measures in our generalized framework. As a special case, we prove equally strong inapproximability results for the problem of scheduling with AND/OR precedence constraints. Finally, we re-introduce the geometry, and continue by realizing several of these hardness results in rather simple geometric settings. We are able to show strong inapproximability results, for example using an assembly consisting solely of unit disks in the plane.
Citations
|
7715
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
515
|
Proof verification and hardness of approximation problems
– Arora, Lund, et al.
- 1992
|
|
351
|
A threshold of ln n for approximating set cover
– Feige
- 1998
|
|
230
|
Approximation algorithms for NP-complete problems on planar graphs
– Baker
- 1994
|
|
86
|
Polynomial-time approximation schemes for Euclidean TSP and other geometric problems
– Arora
- 1998
|
|
57
|
Product Design for Manufacture and Assembly
– Boothroyd, Dewhurst, et al.
- 1994
|
|
51
|
A Compendium of NP Optimization Problems
– Crescenzi, Kann
- 2002
|
|
51
|
Simplified generation of all mechanical assembly sequences
– Fazio, Whitney
- 1987
|
|
50
|
Assembly Automation and Product Design
– Boothroyd
- 1991
|
|
48
|
Computing and verifying depth orders
– Berg, Overmars, et al.
- 1992
|
|
33
|
Scheduling tasks with AND/OR precedence constraints
– Gillies, Liu
- 1995
|
|
30
|
The hardness of approximate optima in lattices, codes and linear equations
– Arora, Babai, et al.
- 1993
|
|
23
|
Complexity measures for assembly sequences
– Goldwasser, Motwani
|
|
20
|
On removing a ball without disturbing the others
– Dawson
- 1984
|
|
19
|
Efficient generation of k-directional assembly sequences
– Agarwal, Berg, et al.
- 1996
|
|
18
|
Counting and cutting cycles of lines and rods in space
– Chazelle, Edelsbrunner, et al.
- 1992
|
|
12
|
Intractability of assembly sequencing: Unit disks in the plane
– Goldwasser, Motwani
- 1997
|
|
11
|
The loading time scheduling problem
– Bhatia, Khuller, et al.
- 1995
|
|
10
|
Approximation complexity of longest common subsequence and shortest common supersequence over fixed alphabet
– Bonizzoni, Duella, et al.
- 1994
|
|
10
|
A hierarchical approach to assembly planning
– Chakrabarty, Wolter
- 1994
|
|
9
|
On assembly sequence planning using petri nets
– Caselli, Zanichelli
- 1995
|
|
8
|
Algorithm for multiple disassembly and parallel assemblies
– Dutta, Woo
- 1995
|
|
7
|
Hardness of Approximations," in Approximation Algorithms for NP-Hard Problems
– Arora, Lund
- 1997
|
|
3
|
Translation separability of polygons," Visual Computer 3
– Dehne, Sack
- 1987
|
