ProceedingsIEEE Computer Society Press - Computer integrated manufacturing systems |
From inside the book
Results 1-3 of 84
Page 74
Bard [1] presented a dynamic programming algorithm for solving the ALB
problem with parallel stations. Solutions represent a trade-off between the
minimum number of stations required to achieve a balance and the cost of
installing additional ...
Bard [1] presented a dynamic programming algorithm for solving the ALB
problem with parallel stations. Solutions represent a trade-off between the
minimum number of stations required to achieve a balance and the cost of
installing additional ...
Page 77
It shows the total cost of the line (arbitrary units), and the loads of stations (ratio of
the sum of process times and the cycle time). The cost of the line is given by the
sum of the cost of the used equipments. The exploitation cost of the line as well ...
It shows the total cost of the line (arbitrary units), and the loads of stations (ratio of
the sum of process times and the cycle time). The cost of the line is given by the
sum of the cost of the used equipments. The exploitation cost of the line as well ...
Page 300
We proposed a Markov chain that enables the determination of system
performance measures such as average holding cost and backlogging cost. We
show how to exploit the Markov chain results to obtain optimal supply planning of
this type ...
We proposed a Markov chain that enables the determination of system
performance measures such as average holding cost and backlogging cost. We
show how to exploit the Markov chain results to obtain optimal supply planning of
this type ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
Monday May 282001 | 1 |
Session M1B Assembly Planning Room | 31 |
Session MIC Production Systeml RoomC | 61 |
Copyright | |
15 other sections not shown
Other editions - View all
Common terms and phrases
4th IEEE International algorithm analysis applied approach Assembly and Task assembly model assembly planning assembly process assembly sequences assembly system assembly task automatic B-spline Bayesian network calculated camera collision components computed configuration constraints contact point coordinate cost defined deformable described developed disassembly sequences dynamic Engineering environment evaluation feasible Figure finger flexible Fukuoka function genetic algorithm geometric grasp holons IEEE International Symposium information entropy Japan liaison Lie algebra machine manipulation matrix mechanical method mobile robot module motion planning node object obstacles obtained operation optimal parameters path planning Petri nets Planning Soft Research precedence graph problem proposed Radon transform represented Robotics and Automation rotation scheduling Screw Theory selected self-organizing map sensor shown in Fig simulation Soft Research Park solutions specification station step structure subassembly Symposium on Assembly Task Planning Soft tion tool trajectory vector velocity
Bibliographic information
| Title | Proceedings |
| Author | IEEE International Symposium on Assembly and Task Planning |
| Contributors | IEEE Robotics and Automation Society, IEEE Xplore (Online service) |
| Publisher | IEEE Computer Society Press |
| Original from | the University of Michigan |
| Digitized | 11 Jan 2008 |
| Export Citation | BiBTeX EndNote RefMan |