ProceedingsIEEE Computer Society Press - Computer integrated manufacturing systems |
From inside the book
Results 1-3 of 84
Page 134
At the end of this phase, the population contains good solutions placed in
different regions of the search space. A parallel Kangaroo algorithm performs the
intensification phase. Every individual solution from this population is considered
as ...
At the end of this phase, the population contains good solutions placed in
different regions of the search space. A parallel Kangaroo algorithm performs the
intensification phase. Every individual solution from this population is considered
as ...
Page 136
Date rule. In this way, the initial solution contains all the jobs sorted after their
correspondent due date. This is a good solution, but it doesn't take into account
the influence of the penalties (a small delay may be penalized a lot). Then, the
initial ...
Date rule. In this way, the initial solution contains all the jobs sorted after their
correspondent due date. This is a good solution, but it doesn't take into account
the influence of the penalties (a small delay may be penalized a lot). Then, the
initial ...
Page 137
This time the improvement of the current solution is not obligatorily. This
procedure can use a different neighborhood definition N'(u) for the random
jumping. A detailed description of the KA is given in [14]. The stop criterion is
either a ...
This time the improvement of the current solution is not obligatorily. This
procedure can use a different neighborhood definition N'(u) for the random
jumping. A detailed description of the KA is given in [14]. The stop criterion is
either a ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
Microassembly Microfactory | 1 |
Microassembly and Microfactory | 2 |
Process Planning | 24 |
Copyright | |
7 other sections not shown
Other editions - View all
Common terms and phrases
actuator applied approach Assembly and Task assembly model assembly operation assembly planning assembly process assembly sequence assembly system assembly tasks axis B-spline batch blocks C-space cell cleanroom components computation configuration configuration space considered contact angle cost cycle defined deflexions developed device disassembly sequence duo-bi environment equation equipment evaluation Figure flexible genetic algorithm geometric gripper HACCP haptic heuristic holons hypergraph IEEE International Symposium industrial industrial robot integrated interface linear manipulation mechanism metaheuristic method micro micro-motor microfactory motion node obtained optical tweezers optimal paper parameters path planning performance Petri nets piezoelectric placement position precedence graphs problem Proc proposed PVDF representation represented Robotics and Automation rotation scheduling sensor simulation solution space sub tour sub-bins subassemblies surface Symposium on Assembly Task Planning Besancon Technology tion tolerancing torque trajectory transition virtual voxels workstation
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 |