ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 15
Page 221
... workstations in such a way that no workstation overflows the cycle time and the minimum number of workstations is used . Thus the Bin Packing Problem leads to a minimization of the number of workstations along the line . Note however ...
... workstations in such a way that no workstation overflows the cycle time and the minimum number of workstations is used . Thus the Bin Packing Problem leads to a minimization of the number of workstations along the line . Note however ...
Page 224
... workstations and ( 2 ) the workstation itself . Indeed , the latter brings in the cost of the indexing device , the cost of the factory space , maintenance , etc. The difficulty of simultaneous minimization of the two components of the ...
... workstations and ( 2 ) the workstation itself . Indeed , the latter brings in the cost of the indexing device , the cost of the factory space , maintenance , etc. The difficulty of simultaneous minimization of the two components of the ...
Page 230
... Workstation Worklist Scroll To Next Task D Combination # : Cycle Time : 64.8 ( sec . ) 1 Of 18 Next Combination 49 Total Time : 62.3 ( 96.1 % ) Accept Clipboard Reject Interupt Last Workstations Edit Figure 7 Workstation task grouping ...
... Workstation Worklist Scroll To Next Task D Combination # : Cycle Time : 64.8 ( sec . ) 1 Of 18 Next Combination 49 Total Time : 62.3 ( 96.1 % ) Accept Clipboard Reject Interupt Last Workstations Edit Figure 7 Workstation task grouping ...
Contents
A New Approach for the Specification of Assembly Systems | 9 |
Plan Representation and Generation for Manufacturing Tasks | 22 |
Lessons Learned from a Second Generation Assembly Planning System | 41 |
Copyright | |
33 other sections not shown
Other editions - View all
Common terms and phrases
algorithm analysis applied approach Artificial Intelligence assembly model assembly operations assembly planning assembly sequences assembly task camera cell clearance collision common ontology components Computer Conf Conference on Robotics configuration space constraints convex coordinates corresponding Cspace decomposition defined described disassembly domain ellipsoid equation example execution feasible fixels fixture function geometric global goal graph grasp gripper handler IEEE implemented initial input insertion intersection knowledge representation machine manipulator Manufacturing Systems mating method motion planning moving nodes object obstacles octree ontology optimal orientation parameters path path planning performance Petri net Petri nets planner position problem Proc process planning rendezvous-point represent representation robot motion Robotics and Automation scheduling sensor shown in Figure simulation snap fastener solution strategy structure subassemblies subgoal task planning ternary operations tion tool trajectory transition uncertainty vector voxels workcell workpieces