The Experts below are selected from a list of 84 Experts worldwide ranked by ideXlab platform

Mituhiko Araki - One of the best experts on this subject based on the ideXlab platform.

  • genetic algorithm approach to multi objective scheduling problem in Plastics Forming plant
    APMS, 1998
    Co-Authors: Hisashi Tamaki, Tomohiro Mukai, Kenji Kawakami, Mituhiko Araki
    Abstract:

    In this paper, a method of applying genetic algorithms (GAs) to multi-objective scheduling problems is proposed. The key points are (1) an alphabetical representation (i.e., genotype) of feasible schedules (i.e., phenotype), and (2) a reproduction operator of GAs which combines the parallel selection with the Pareto reservation strategy. In the paper, through computational experiments, it is shown that not only one of the Pareto-optimal schedules of a problem but a set of such solutions can be obtained by a single run of the proposed method.

  • APMS - Genetic algorithm approach to multi-objective scheduling problem in Plastics Forming plant
    Advances in Production Management Systems, 1998
    Co-Authors: Hisashi Tamaki, Tomohiro Mukai, Kenji Kawakami, Mituhiko Araki
    Abstract:

    In this paper, a method of applying genetic algorithms (GAs) to multi-objective scheduling problems is proposed. The key points are (1) an alphabetical representation (i.e., genotype) of feasible schedules (i.e., phenotype), and (2) a reproduction operator of GAs which combines the parallel selection with the Pareto reservation strategy. In the paper, through computational experiments, it is shown that not only one of the Pareto-optimal schedules of a problem but a set of such solutions can be obtained by a single run of the proposed method.

  • application of meta heuristics to scheduling problems in Plastics Forming plant
    IFAC Proceedings Volumes, 1995
    Co-Authors: Hisashi Tamaki, Kazuyuki Taguchi, Mituhiko Araki
    Abstract:

    Abstract A scheduling problem in a Plastics Forming plant is studied. This problem basically belongs to the class of unrelated parallel machine problems, but includes several restrictions which originate from the necessity to use auxiliary equipments. We have proposed a method to solve them without relying upon dispatching rules by transForming the scheduling problem to a mathematical programming problem, and by representing feasible schedules by binary strings. This formulation enables to use the meta-heuristics (such as simulated annealing, genetic algorithms, etc.). In this paper, we propose a way for improving a search by meta-heuristics by modifying the representation of a schedule, i.e., not using the binary representation but using an alphabetical one. We actually carried out computational experiments for the problems of practical size, which shows that our methods can give satisfactory solutions to the considered scheduling problem

  • application of search methods to scheduling problem in Plastics Forming plant a binary representation approach
    Conference on Decision and Control, 1993
    Co-Authors: Hisashi Tamaki, Y Hasegawa, J Kozasa, Mituhiko Araki
    Abstract:

    In this paper, a scheduling problem in a Plastics Forming plant is studied. This problem basically belongs to the class of unrelated parallel machine problems, but includes several restrictions which originate from the necessity to use auxiliary equipment. Thus it can be regarded as a representative example of complex scheduling problems arising in industries. The paper presents a new scope for the study of practical scheduling problems by proposing a method to solve them without relying upon dispatching rules. First, we transform the scheduling problem to a mathematical programming problem, and represent feasible schedules by binary strings. This formulation enables us to use the search methods (such as simulated annealing methods, genetic algorithms, etc.). We actually coded several search-methods and carried out computational experiments for the problems of practical size. Results indicate that our methods can give satisfactory solutions to the considered scheduling problem. >

Hisashi Tamaki - One of the best experts on this subject based on the ideXlab platform.

  • genetic algorithm approach to multi objective scheduling problem in Plastics Forming plant
    APMS, 1998
    Co-Authors: Hisashi Tamaki, Tomohiro Mukai, Kenji Kawakami, Mituhiko Araki
    Abstract:

    In this paper, a method of applying genetic algorithms (GAs) to multi-objective scheduling problems is proposed. The key points are (1) an alphabetical representation (i.e., genotype) of feasible schedules (i.e., phenotype), and (2) a reproduction operator of GAs which combines the parallel selection with the Pareto reservation strategy. In the paper, through computational experiments, it is shown that not only one of the Pareto-optimal schedules of a problem but a set of such solutions can be obtained by a single run of the proposed method.

  • APMS - Genetic algorithm approach to multi-objective scheduling problem in Plastics Forming plant
    Advances in Production Management Systems, 1998
    Co-Authors: Hisashi Tamaki, Tomohiro Mukai, Kenji Kawakami, Mituhiko Araki
    Abstract:

    In this paper, a method of applying genetic algorithms (GAs) to multi-objective scheduling problems is proposed. The key points are (1) an alphabetical representation (i.e., genotype) of feasible schedules (i.e., phenotype), and (2) a reproduction operator of GAs which combines the parallel selection with the Pareto reservation strategy. In the paper, through computational experiments, it is shown that not only one of the Pareto-optimal schedules of a problem but a set of such solutions can be obtained by a single run of the proposed method.

  • application of meta heuristics to scheduling problems in Plastics Forming plant
    IFAC Proceedings Volumes, 1995
    Co-Authors: Hisashi Tamaki, Kazuyuki Taguchi, Mituhiko Araki
    Abstract:

    Abstract A scheduling problem in a Plastics Forming plant is studied. This problem basically belongs to the class of unrelated parallel machine problems, but includes several restrictions which originate from the necessity to use auxiliary equipments. We have proposed a method to solve them without relying upon dispatching rules by transForming the scheduling problem to a mathematical programming problem, and by representing feasible schedules by binary strings. This formulation enables to use the meta-heuristics (such as simulated annealing, genetic algorithms, etc.). In this paper, we propose a way for improving a search by meta-heuristics by modifying the representation of a schedule, i.e., not using the binary representation but using an alphabetical one. We actually carried out computational experiments for the problems of practical size, which shows that our methods can give satisfactory solutions to the considered scheduling problem

  • application of search methods to scheduling problem in Plastics Forming plant a binary representation approach
    Conference on Decision and Control, 1993
    Co-Authors: Hisashi Tamaki, Y Hasegawa, J Kozasa, Mituhiko Araki
    Abstract:

    In this paper, a scheduling problem in a Plastics Forming plant is studied. This problem basically belongs to the class of unrelated parallel machine problems, but includes several restrictions which originate from the necessity to use auxiliary equipment. Thus it can be regarded as a representative example of complex scheduling problems arising in industries. The paper presents a new scope for the study of practical scheduling problems by proposing a method to solve them without relying upon dispatching rules. First, we transform the scheduling problem to a mathematical programming problem, and represent feasible schedules by binary strings. This formulation enables us to use the search methods (such as simulated annealing methods, genetic algorithms, etc.). We actually coded several search-methods and carried out computational experiments for the problems of practical size. Results indicate that our methods can give satisfactory solutions to the considered scheduling problem. >

Xun Xu - One of the best experts on this subject based on the ideXlab platform.

  • Plastics Forming processes and the applications of cad cam technology
    Transactions of the Institution of Professional Engineers New Zealand: Electrical Mechanical Chemical Engineering Section, 1999
    Co-Authors: Xun Xu
    Abstract:

    Plastics processes play an important and irreplaceable role in manufacturing industry as well as our daily lives. This paper focuses on the Plastics Forming processes with a focus on moulding processes. An overview of some basic Plastics Forming processes, their products and production capacities, is presented. These processes include extrusion, blow moulding, rotational moulding, compression moulding, transfer moulding, thermoForming and injection moulding. The future trend is envisaged with respect to the Forming processes, machinery, moulds and materials. Also highlighted is the computer-aided design and manufacturing (CAD/CAM) technology being used by the industry. Some leading CAD/CAM packages are reviewed in light of their capabilities and applicability. The paper also lays an emphasis on the status of the New Zealand situation in the Plastics Forming industry. A survey showed that the New Zealand Plastics industry involves over 400 enterprises, mostly small. The majority of them only operate a single moulding process, with injection moulding being the principal process. While some companies have their own CAD/CAM facilities in-house, others still contract out their jobs for product development, although many companies are already in the process of computerising the processes of their product design, mould design, and manufacturing.

  • Plastics Forming Processes and the Applications of CAD/CAM Technology
    1999
    Co-Authors: Xun Xu
    Abstract:

    Plastics processes play an important and irreplaceable role in manufacturing industry as well as our daily lives. This paper focuses on the Plastics Forming processes with a focus on moulding processes. An overview of some basic Plastics Forming processes, their products and production capacities, is presented. These processes include extrusion, blow moulding, rotational moulding, compression moulding, transfer moulding, thermoForming and injection moulding. The future trend is envisaged with respect to the Forming processes, machinery, moulds and materials. Also highlighted is the computer-aided design and manufacturing (CAD/CAM) technology being used by the industry. Some leading CAD/CAM packages are reviewed in light of their capabilities and applicability. The paper also lays an emphasis on the status of the New Zealand situation in the Plastics Forming industry. A survey showed that the New Zealand Plastics industry involves over 400 enterprises, mostly small. The majority of them only operate a single moulding process, with injection moulding being the principal process. While some companies have their own CAD/CAM facilities in-house, others still contract out their jobs for product development, although many companies are already in the process of computerising the processes of their product design, mould design, and manufacturing.

Kenji Kawakami - One of the best experts on this subject based on the ideXlab platform.

  • genetic algorithm approach to multi objective scheduling problem in Plastics Forming plant
    APMS, 1998
    Co-Authors: Hisashi Tamaki, Tomohiro Mukai, Kenji Kawakami, Mituhiko Araki
    Abstract:

    In this paper, a method of applying genetic algorithms (GAs) to multi-objective scheduling problems is proposed. The key points are (1) an alphabetical representation (i.e., genotype) of feasible schedules (i.e., phenotype), and (2) a reproduction operator of GAs which combines the parallel selection with the Pareto reservation strategy. In the paper, through computational experiments, it is shown that not only one of the Pareto-optimal schedules of a problem but a set of such solutions can be obtained by a single run of the proposed method.

  • APMS - Genetic algorithm approach to multi-objective scheduling problem in Plastics Forming plant
    Advances in Production Management Systems, 1998
    Co-Authors: Hisashi Tamaki, Tomohiro Mukai, Kenji Kawakami, Mituhiko Araki
    Abstract:

    In this paper, a method of applying genetic algorithms (GAs) to multi-objective scheduling problems is proposed. The key points are (1) an alphabetical representation (i.e., genotype) of feasible schedules (i.e., phenotype), and (2) a reproduction operator of GAs which combines the parallel selection with the Pareto reservation strategy. In the paper, through computational experiments, it is shown that not only one of the Pareto-optimal schedules of a problem but a set of such solutions can be obtained by a single run of the proposed method.

Tomohiro Mukai - One of the best experts on this subject based on the ideXlab platform.

  • genetic algorithm approach to multi objective scheduling problem in Plastics Forming plant
    APMS, 1998
    Co-Authors: Hisashi Tamaki, Tomohiro Mukai, Kenji Kawakami, Mituhiko Araki
    Abstract:

    In this paper, a method of applying genetic algorithms (GAs) to multi-objective scheduling problems is proposed. The key points are (1) an alphabetical representation (i.e., genotype) of feasible schedules (i.e., phenotype), and (2) a reproduction operator of GAs which combines the parallel selection with the Pareto reservation strategy. In the paper, through computational experiments, it is shown that not only one of the Pareto-optimal schedules of a problem but a set of such solutions can be obtained by a single run of the proposed method.

  • APMS - Genetic algorithm approach to multi-objective scheduling problem in Plastics Forming plant
    Advances in Production Management Systems, 1998
    Co-Authors: Hisashi Tamaki, Tomohiro Mukai, Kenji Kawakami, Mituhiko Araki
    Abstract:

    In this paper, a method of applying genetic algorithms (GAs) to multi-objective scheduling problems is proposed. The key points are (1) an alphabetical representation (i.e., genotype) of feasible schedules (i.e., phenotype), and (2) a reproduction operator of GAs which combines the parallel selection with the Pareto reservation strategy. In the paper, through computational experiments, it is shown that not only one of the Pareto-optimal schedules of a problem but a set of such solutions can be obtained by a single run of the proposed method.