this research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. this objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. moreover, this type of problem is np-hard and solving this probl...

there are some machineries and equipments as well as relatively fix amount of human resources involved in any production process. in many cases, by observing operational method of a process, one may see that some of these machineries are not working, but on the other hand, other equipments are continuously working, and many parts are set in front of them, waiting to be set up over machines to c...

the task of balancing of assembly lines is well-known in mass production system but this problem is np-hard even for the simple straight line. therefore, utilizing heuristic methods for these problems is totally unquestionable. furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...

This paper is introduced to be the obstacle recognition, path planning and oscillating control for an automobile crane system on-line. We studied the autonomous mobile overhead traveling crane so for. In particular, the research of obstacle recognition, path plan and oscillating control is carried out. For on-line obstacle recognition, the obstacle recognition system using the ultrasonic sensor...

Artificial Intelligence planning is a key problem solving technology currently being used in a variety of applications including military campaigns, robot navigation, airplane scheduling, and human computer interaction. The generation of plans courses of actions to achieve desired goals or perform specific tasks is a costly process, however. Developing methods to systematically reduce the searc...

We consider the problem of on-line continual planning, in which additional goals may arrive while plans for previous goals are still executing and plan quality may depend on how quickly goals are achieved. Even in domains with deterministic actions, this is a challenging problem. One common and straightforward approach is reactionary planning, in which fresh plans are synthesized when a new goa...

We describe a real manufacturing problem that lies between job shop scheduling and temporal planning. The setting is online in the sense that new jobs arrive asynchronously, perhaps several per second, while plans for previous jobs are being executed. We formalize the problem as a variant of STRIPS extended with action durations and resources. We present a hybrid algorithm for this problem that...

This paper addresses the issue of path planning in a virtual environment (VE) for the control of an Internet-based robot manipulator. A hybrid method is proposed in which the dimension of the path-planning problem is reduced by separating the problem of planning the position of the gripper from that of planning the pose of the gripper. A global configuration-space technique is used for the form...