M. Yamamoto

The University of Tokyo, Tokyo, Tokyo-to, Japan

Are you M. Yamamoto?

Claim your profile

Publications (7)0 Total impact

  • [Show abstract] [Hide abstract]
    ABSTRACT: The cutting stock problem (CSP) is an important problem that affects the profit of the processing industries. The CSP that deals with a set of rectangular items is classified as the 2D rectangular cutting stock problem (2DRCSP). Although the 2DRCSP has been researched widely in the field of mathematical programming, the solutions of these studies are not always suitable for the actual manufacturing. This is because most of the existing studies do not consider the cutting process in actual manufacturing. In this report, we formulate a solution for the 2DRCSP with the constraints of the cutting process being considered. As for the approach, we calculate smaller patterns of arrangement and perform all of arrangement by using them iteratively. In addition, we use the simulated annealing method to calculate their length.
    Automation Science and Engineering, 2007. CASE 2007. IEEE International Conference on; 10/2007
  • [Show abstract] [Hide abstract]
    ABSTRACT: Semiconductor manufacturing is mainly characterized by diversity of products, different process types, and random failures. It is extremely difficult to solve scheduling problems due to high frequency of disturbance occurrence. This paper proposes a new approach for the online manufacturing rescheduling method. Instead of having a dispatching process based on dispatching rules once again, we revise the existing schedule based on message passing principle once the disturbance occurs, and improve the performance of the revised schedule by the introduction of a quick local search according to permutations of processes on semi-critical paths. The proposed method can release the influence of disturbances in less than 1 second, and finish rescheduling process in less than 1 minute. Through the actual problems with about 200,000 processes, this method is evaluated to be more effective for actual manufacturing than the dispatching-rule based methods, some of which have been applied in many facilities
    Intelligent Robots and Systems, 2006 IEEE/RSJ International Conference on; 11/2006
  • [Show abstract] [Hide abstract]
    ABSTRACT: In semiconductor manufacturing, rescheduling problems are extremely difficult to solve in real time due to the high frequency of disturbances that occur approximately every minute. This paper proposes a new approach to online manufacturing rescheduling. Unlike the traditional methods to have a scheduling process again, we (1) revise the existing schedule to keep high schedule stability based on message passing rescheduling with operation sorting; and (2) during the manufacturing process, improve the performance of the revised schedule with the introduction of a quick local search on semi-critical paths. In actual problems with about 200,000 processes, this method can effectively accommodate disturbances in less than 1 second, and a better schedule can be obtained in less than 1 minute. This method has been demonstrated to be more effective than conventional dispatching-rule methods, some of which have been actually applied in many facilities, because it offers higher schedule stability and fewer violations of due dates
    Automation Science and Engineering, 2006. CASE '06. IEEE International Conference on; 11/2006
  • [Show abstract] [Hide abstract]
    ABSTRACT: The job-shop scheduling problem (JSSP) is one of the most difficult NP-hard combinatorial optimization problems. It is extremely difficult to solve the complex job shop scheduling problems because of the disturbances of manufacturing environment. This paper proposes a new method based on the reaction-diffusion equation on a graph [Yuasa, H and Ito, M (1998)] to solve JSSP with disturbances. This method considers the operations of JSSP as the autonomous decentralized system elements. According to the definition of the local potential functions between two operations (two operations on the same machine or the same job), the original schedule can be revised to accommodate with the disturbances of manufacturing, such as machine breakdown, processing time variation, in a short time. The present method is tested for benchmark problems with disturbances.
  • J. Ota, M. Yamamoto, K. Ikeda, Y. Aiyama, T. Arai
    [Show abstract] [Hide abstract]
    ABSTRACT: Presents a methodology of environmental support for autonomous mobile robots using visual marks with memory storage. The mark makes up for insufficient function of sensing and recognition; self-positioning, positioning of objects, and deciding methods to operate objects. The mark proposed in this paper consists of a landmark part and a memory part. The landmark part is used to estimate the relative position and orientation between robots and the mark, and the memory part gives information about what it is, what tasks there are, and how to conduct the tasks. Task execution using the marks with real robots is described to show the effectiveness of the proposed methodology
    Robotics and Automation, 1999. Proceedings. 1999 IEEE International Conference on; 02/1999
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: One of the major emerging problems of distributed mobile robotic system is what kind of inter-robot communication to use, because of increasing robots integrated in the system. This paper aims to give an analytical view of this issue. The efficiency of local and global communication is compared based on the analysis of information transmission time to multiple robots. We will show that local communication is effective in environments where cooperative tasks are executed by multiple mobile robots in distributed fashion
    Intelligent Robots and Systems '96, IROS 96, Proceedings of the 1996 IEEE/RSJ International Conference on; 12/1996
  • [Show abstract] [Hide abstract]
    ABSTRACT: Local communication system is considered appropriate when many mobile robots should achieve cooperation, from the standpoint of cost and capacity of communication. This paper presents a design method of the optimal communication range for efficient local communication system. The analyses of optimization are made by minimizing the information transition time, first in the case of transmission to an arbitrary robot, and next, to multiple robots. Computer simulations have been undertaken to verify the analytical results
    Intelligent Robots and Systems 95. 'Human Robot Interaction and Cooperative Robots', Proceedings. 1995 IEEE/RSJ International Conference on; 09/1995