2022/06/29 更新

写真a

フジムラ シゲル
藤村 茂
所属
理工学術院 大学院情報生産システム研究科
職名
教授
ホームページ

兼担

  • 理工学術院   基幹理工学部

学内研究所等

  • 2020年
    -
    2022年

    理工学術院総合研究所   兼任研究員

学位

  • 早稲田大学(日本)   博士(工学)

所属学協会

  •  
     
     

    IEEE

  •  
     
     

    電気学会

  •  
     
     

    情報処理学会

 

研究分野

  • ソフトウェア

  • 制御、システム工学

  • 知能情報学

  • 制御、システム工学

研究キーワード

  • 生産管理、生産スケジューリング、オブジェクト指向、エージェント、システム情報(知識)処理、生産システム工学、ヒューマンインターフェイス、人工知能アーキテクチャ、生産情報アーキテクチャ

論文

  • Localization strategy for island model genetic algorithm to preserve population diversity

    Alfian Akbar Gozali, Shigeru Fujimura

    Studies in Computational Intelligence   719   149 - 161  2018年

     概要を見る

    Years after being firstly introduced by Fraser and remodeled for modern application by Bremermann, genetic algorithm (GA) has a significant progression to solve many kinds of optimization problems. GA also thrives into many variations of models and approaches. Multi-population or island model GA (IMGA) is one of the commonly used GA models. IMGA is a multi-population GA model objected to getting a better result (aimed to get global optimum) by intrinsically preserve its diversity. Localization strategy of IMGA is a new approach which sees an island as a single living environment for its individuals. An island’s characteristic must be different compared to other islands. Operator parameter configuration or even its core engine (algorithm) represents the nature of an island. These differences will incline into different evolution tracks which can be its speed or pattern. Localization strategy for IMGA uses three kinds of single GA core: standard GA, pseudo GA, and informed GA. Localization strategy implements migration protocol and the bias value to control the movement. The experiment results showed that localization strategy for IMGA succeeds to solve 3-SAT with an excellent performance. This brand new approach is also proven to have a high consistency and durability.

    DOI

  • Abnormal Data Analysis in Process Industries using Deep-Learning Method

    Wen Song

    2017 International Conference on Industrial Engineering and Engineering Management (IEEM 2017)    2017年12月

  • Performance analysis of localization strategy for island model genetic algorithm

    Alfian Akbar Gozali, Shigeru Fujimura

    Proceedings - 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2017     425 - 430  2017年08月

     概要を見る

    Genetic algorithm (GA) is one of the standard solutions to solve many optimization problems. One of a GA type used for solving a case is island model GA (IMGA). Localization strategy is a brand-new feature for IMGA to better preserves its diversity. In the previous research, localization strategy could carry out 3SAT problem almost perfectly. In this study, the proposed feature is aimed to solve real parameter single objective computationally expensive optimization problems. Differ with an issue in previous research which has a prior knowledge and binary, the computationally expensive optimization has not any prior knowledge and floating type problem. Therefore, the localization strategy and its GA cores must adapt. The primary goal of this research is to analyze further the localization strategy for IMGA's performance. The experiments show that the new feature is successfully modified to meet the new requirement. Localization strategy for IMGA can solve all computationally expensive functions consistently. Moreover, this new feature could make IMGA reaches leading ratio 0.47 among other current solvers.

    DOI

  • Performance analysis of localization strategy for island model genetic algorithm

    Alfian Akbar Gozali, Shigeru Fujimura

    Proceedings - 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2017     327 - 332  2017年08月

     概要を見る

    Genetic algorithm (GA) is one of the standard solutions to solve many optimization problems. One of a GA type used for solving a case is island model GA (IMGA). Localization strategy is a brand-new feature for IMGA to better preserves its diversity. In the previous research, localization strategy could carry out 3SAT problem almost perfectly. In this study, the proposed feature is aimed to solve real parameter single objective computationally expensive optimization problems. Differ with an issue in previous research which has a prior knowledge and binary, the computationally expensive optimization has not any prior knowledge and floating type problem. Therefore, the localization strategy and its GA cores must adapt. The primary goal of this research is to analyze further the localization strategy for IMGA's performance. The experiments show that the new feature is successfully modified to meet the new requirement. Localization strategy for IMGA can solve all computationally expensive functions consistently. Moreover, this new feature could make IMGA reaches leading ratio 0.47 among other current solvers.

    DOI

  • Abnormal State Prediction based on Deep Learning using Multiple Time Series Production Process Data

    Shigeru Fujimura

    International Work-Conference on Time Series Analysis (ITISE 2017)    2017年07月

  • An Approach for Energy Conservation in Just-In-Time Production

    Yifan Yang, Wei Weng, Shigeru Fujimura

    2017 SICE INTERNATIONAL SYMPOSIUM ON CONTROL SYSTEMS (SICE ISCS)     89 - 92  2017年  [査読有り]

     概要を見る

    Nowadays, energy conservation is one of the most talked about issues in our life, it is also increasingly important in dynamic flexible flow shop scheduling problems. Previous research did much on how to minimize total earliness and tardiness of all jobs, or to achieve just-in-time production, whereas little effort has been made on how to save energy. Therefore, to address such need, a dynamic machine switching method has been proposed in this paper. The main purpose is to minimize both energy consumption and just-in-time production objectives. Featured by switching machines dynamically, the proposed method has been tested on different environments, whose results show that it has good performance for energy conservation.

  • An Improved Teaching-Learning-Based Optimization Algorithm to Solve Job Shop Scheduling Problems

    Linna Li, Wei Weng, Shigeru Fujimura

    2017 16TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS 2017)     797 - 801  2017年  [査読有り]

     概要を見る

    Job shop scheduling problem (JSP) is a strongly NP-hard combinatorial optimization problem. It is difficult to solve the problem to the optimum in a reasonable time. Teaching-learning-based optimization (TLBO) algorithm is a novel population oriented meta-heuristic algorithm. It has been proved that TLBO has a considerable potential when compared to the best-known heuristic algorithms for scheduling problems. In this paper, the traditional TLBO is improved to enhance diversification and intensification when exploring solutions for JSP. The improvements include changing the coding method, increasing number of teachers, introducing new learners and performing local search around potentially optimal solutions. To show effectiveness of the improved TLBO algorithm, the simulation results obtained by the improved TLBO for benchmark problems are compared with results obtained by the traditional TLBO and the best known lower bounds.

    DOI

  • A Hybrid MTS-MTO Production Model with a Dynamic Decoupling Point for Flexible Flow Shops

    Yanchao Jia, Wei Weng, Shigeru Fujimura

    2017 16TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS 2017)     803 - 807  2017年  [査読有り]

     概要を見る

    Competition and resultant complexity of today's production industry require that enterprises realize the importance of reducing total costs in production. Uncertainties of customer orders also make it difficult to determine the schedule for minimizing inventories, earliness and tardiness. In this paper, we propose a new production model for flexible flow shops, which aims to reduce the total inventories, earliness and tardiness. The model divides a flexible flow shop (FFS) into a make-to-stock (MTS) part and a make-to-order (MTO) part by applying a decoupling point. In the MTS part, jobs are manufactured into semi-finished products and then stored as inventories at the decoupling point. As soon as a customer order is received, the inventories are released into the system, starting undergoing processing in the MTO part. This shortens the lead time for manufacturing the products. Another advantage of the proposed model is that the less number of operations in the MTO part than that in a job makes it easier to avoid tardiness. In addition, we designed two types of models: dynamic and static, which depends on whether the decoupling point is dynamically adjusted to adapt to different arrival rates of customer orders. The reason why we design two types is to compare the performance of the proposed two models. Results show that the dynamic hybrid model outperforms pull, push and static hybrid models for reducing costs.

    DOI

  • Improvements to Genetic Algorithm for Flexible Job Shop Scheduling with Overlapping in Operations

    Yiyong He, Wei Weng, Shigeru Fujimura

    2017 16TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS 2017)     791 - 796  2017年  [査読有り]

     概要を見る

    Flexible job-shop scheduling problem (FJSP) is an extended job-shop scheduling problem. FJSP allows an operation to be processed by several different machines. FJSP with overlapping in operations means that each operation is divided into several sublots. Sublots are processed and transferred separately without waiting for the entire operation to be processed. In previous research, a mathematical model was developed and a genetic algorithm proposed to solve this problem. In this study, we try to improve the procedure of previous research to achieve better results. The proposed improvements were tested on some benchmark problems and compared with the results obtained by previous research.

    DOI

  • A genetic algorithm with local search using activity list characteristics for solving resource-constrained multiproject scheduling problem

    Ikutaro Okada, Wei Weng, Wenbai Yang, Shigeru Fujimura

    IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING   11   S34 - S43  2016年12月  [査読有り]

     概要を見る

    In this paper, we aim to solve the resource-constrained multiproject scheduling problem (rc-mPSP), in which more than one project are scheduled simultaneously, projects share global resources, and the average project delay and total project time are minimized as objectives. In order to solve this problem by a centralized scheduling method, we present a new genetic algorithm (GA) approach. In this procedure, we follow the GA described in Okada et al.. (2014) and improve its genetic operators, such as crossover and mutation, and local search so as to work better on rc-mPSP. Furthermore, in order to evaluate the proposed approach, we compare the results of the computational experiment on certain standard project instances with the several competing decentralized methods and centralized methods presented in the literature. We show that our procedure is one of the most competitive among such algorithms. (c) 2014 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

    DOI

  • A genetic algorithm with local search using activity list characteristics for solving resource-constrained multiproject scheduling problem

    Ikutaro Okada, Wei Weng, Wenbai Yang, Shigeru Fujimura

    IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING   11   S34 - S43  2016年12月  [査読有り]

     概要を見る

    In this paper, we aim to solve the resource-constrained multiproject scheduling problem (rc-mPSP), in which more than one project are scheduled simultaneously, projects share global resources, and the average project delay and total project time are minimized as objectives. In order to solve this problem by a centralized scheduling method, we present a new genetic algorithm (GA) approach. In this procedure, we follow the GA described in Okada et al.. (2014) and improve its genetic operators, such as crossover and mutation, and local search so as to work better on rc-mPSP. Furthermore, in order to evaluate the proposed approach, we compare the results of the computational experiment on certain standard project instances with the several competing decentralized methods and centralized methods presented in the literature. We show that our procedure is one of the most competitive among such algorithms. (c) 2014 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

    DOI

  • Integrating genetic algorithm with time control for just-in-time scheduling problems

    Chen, Junru, Weng, Wei, Rong, Gang, Fujimura, Shigeru

    IFAC-PapersOnLine   28 ( 3 ) 893 - 897  2016年01月

     概要を見る

    © 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.To reduce inventory costs and increase customer satisfaction in a real production environment, Just-in-Time (JIT) manufacturing should be combined with more flexibility. Flexibility in manufacturing system ensures improved product quality and mass customization. In this paper, we consider flexible job-shop problem (FJSP) to include several types of flexibility. Prior research on JIT scheduling problems paid little attention to flexible job shop systems. In this paper, an optimization method for FJSP for JIT manufacturing was proposed, genetic algorithm and time control are integrated to improve the JIT performance. Computational simulations and comparisons demonstrate that the proposed method shows more competitive performance than other evolutionary algorithms.

    DOI

  • Methods to estimate the lead time of an order in a flexible flowshop

    Wei Weng, Shigeru Fujimura

    PROCEEDINGS 2016 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL TECHNOLOGY (ICIT)   2016-May   1353 - 1356  2016年  [査読有り]

     概要を見る

    We consider the problem of estimating lead times of orders that arrive dynamically in a flexible flow shop. When an order arrives, we estimate the time between its arrival and its completion. Good estimation would help improve on-time delivery. Existing estimation methods are mostly designed based on an order's processing time and the shop's inventory status. We improve the accuracy of estimation by developing new methods that further take into account the characteristics of the shop system such as parallelization of queues. We also consider the bottleneck effect, which might largely dominate the waiting time in the system. Results of computational experiments show that the proposed methods outperform existing methods in terms of some accuracy measures.

    DOI

  • Estimating job flow times by using an agent-based approach

    Wei Weng, Shigeru Fujimura

    PROCEEDINGS 2016 5TH IIAI INTERNATIONAL CONGRESS ON ADVANCED APPLIED INFORMATICS IIAI-AAI 2016     975 - 979  2016年  [査読有り]

     概要を見る

    We consider the problem of estimating flow times of jobs that arrive dynamically in a manufacturing system. A job's flow time refers to the time between the job's arrival and completion. Most existing methods use some predefined equations for such estimation, and most of the equations are designed for single machine manufacturing systems. To better estimate the flow time of a job in a more complex system in which there are multiple machines and multiple workstations, we propose a distributed learning approach that divides the manufacturing system into multiple small parts and collects real-time local information in each part to predict the waiting time for a job. We evaluate the proposed approach by comparing it with existing methods using a variety of problem instances. The results show that the proposed approach outperforms existing methods and accordingly might improve the level of customer service when being used for due date promising.

    DOI

  • Multi-agent Just-in-time Manufacturing Scheduling System for Dynamic Environment

    Yingzhe Jiang, Wei Weng, Shigeru Fujimura

    PROCEEDINGS 2016 5TH IIAI INTERNATIONAL CONGRESS ON ADVANCED APPLIED INFORMATICS IIAI-AAI 2016     1022 - 1025  2016年  [査読有り]

     概要を見る

    This article proposes a novel method to solve the manufacturing scheduling problems in multi-agent system (MAS) for dynamic environment. The study focuses on the machine selection work for jobs and proposes a remaining time prediction method, which will help a job choose machines based on estimated finishing time. In this way, we can keep the job finishing just-in-time, which aims to support a customer-oriented lead time policy, and can provide better manufacturing performance and increase customer service level. This article provides experimental results compared with another approach in previous research, through which we can find that in some case if we put the Just-in-time philosophy into consideration, the proposed method will deliver competitive performance.

    DOI

  • Internet of Things Value for Mechanical Engineers and Evolving Commercial Product Lifecycle Management System

    S. Goto, O. Yoshie, S. Fujimura

    2016 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM)   2016-December   1021 - 1024  2016年  [査読有り]

     概要を見る

    Currently, expectations from Internet of Things (IoT) are extremely high worldwide. However, mechanical engineers working on product design processes do not always benefit. This paper utilizes the up-to-date IoT-enabled commercial product lifecycle management (PLM) system to examine the effectiveness of IoT value for mechanical engineers. Moreover, it discusses the maturity model for digital engineering for the new era of WT. Furthermore, this paper introduces significant initiatives such as a PLM functionality connected to everything, monitoring of field data for getting back to design process, and virtual 3D data and real field data superposition. This paper concludes that there is high potential to use IoT technology for mechanical engineers from the perspective of quality and reliability design innovations.

    DOI

  • Integrating genetic algorithm with time control for just-in-time scheduling problems

    Chen, Junru, Weng, Wei, Rong, Gang, Fujimura, Shigeru

    IFAC Proceedings Volumes (IFAC-PapersOnline)   48 ( 3 ) 893 - 897  2015年05月

     概要を見る

    © 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved. To reduce inventory costs and increase customer satisfaction in a real production environment, Just-in-Time (JIT) manufacturing should be combined with more flexibility. Flexibility in manufacturing system ensures improved product quality and mass customization. In this paper, we consider flexible job-shop problem (FJSP) to include several types of flexibility. Prior research on JIT scheduling problems paid little attention to flexible job shop systems. In this paper, an optimization method for FJSP for JIT manufacturing was proposed, genetic algorithm and time control are integrated to improve the JIT performance. Computational simulations and comparisons demonstrate that the proposed method shows more competitive performance than other evolutionary algorithms.

    DOI

  • Integrating Genetic Algorithm with Time Control for Just-In-Time Scheduling Problems

    Junru Chen, Wei Weng, Gang Rong, Shigeru Fujimura

    IFAC PAPERSONLINE   48 ( 3 ) 893 - 897  2015年  [査読有り]

     概要を見る

    To reduce inventory costs and increase customer satisfaction in a real production environment, Just-in-Time (JIT) manufacturing should be combined with noire flexibility. Flexibility in manufacturing system ensures improved product quality and mass customization. In this paper, we consider flexible job-shop problem (FJSP) to include several types of flexibility. Prior research on JIT scheduling problems paid little attention to flexible job shop systems. En this paper, an optimization method for FJSP for JIT manufacturing was proposed, genetic algorithm and tinge control are integrated to improve the JIT performance. Computational simulations and comparisons demonstrate that the proposed method shows more competitive performance than other evolutionary algorithms. (C) 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

    DOI

  • An Efficient Mathematical Model for a Generalized Production Process

    Wei Weng, Cheng Chen, Gang Rong, Shigeru Fujimura

    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2014 (ICNAAM-2014)   1648  2015年  [査読有り]

     概要を見る

    This study proposes an efficient mixed integer linear programming (MILP) model for a generalized job shop production process. In the process, a workstation contains one or multiple machines and each job visits some of the workstations in a specific sequence. It is allowed that a job visits the same workstation more than once. Although some similar processes were modeled by MILP in previous studies, the models are unable to solve problems that involve more than ten jobs due to high computational complexity. Our proposed model outperforms the best model that is identified among 23 research papers with regard to computational complexity. Simulation results show that our model is able to solve a problem with a dozen of jobs, which is classified as a large-scale problem in the literature.

    DOI

  • Spiral-Evolutional Production Scheduling System

    Shigeru Fujimura, Wei Weng

    2015 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM)   2016-January   1442 - 1446  2015年  [査読有り]

     概要を見る

    Although many production scheduling systems are developed, it is difficult to introduce for medium-sized enterprises, because of high cost of initial and maintenance investment. However functions provided by it, such as available-to-promise under the restrictions of the own process, resource leveling and so on, are required by all of enterprises to make their profits. To realize a scheduling system, which can be introduced more easily for the small and medium-sized enterprises, a novel spiral-evolutional scheduling system is proposed in this paper. This system is getting started with gathering of production information in factories, and through progress monitoring a scheduling function is installed and evolved in a spiral evolutional systemizing process. In this paper, the concept of the spiral-evolutional production scheduling system is described, and the implementation of this system and the merit of introduction of it are shown.

    DOI

  • 生産スケジューリングシステム導入ガイド〜失敗しないシステム開発のために〜

    生産スケジューリング業務のシステム化規範に関する協同研究委員会編

    電気学会技術報告   ( 1311 )  2014年06月

  • Energy-efficient Scheduling for Flexible Flow Shops by Using MIP

    Fangfang Xu, Wei Weng, Shigeru Fujimura

    2014 The Industrial and Systems Engineering Research Conference(2014 ISERC)    2014年05月

  • A genetic algorithm with local search using activity list characteristics for solving resource-constrained project scheduling problem with multiple modes

    Ikutaro Okada, Koji Takahashi, Wenqiang Zhang, Xiaofu Zhang, Hongyu Yang, Shigeru Fujimura

    IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING   9 ( 2 ) 190 - 199  2014年03月  [査読有り]

     概要を見る

    In this paper, we aim to solve the problem of resource-constrained project scheduling with multiple modes (rc-PSP/mM), in which multiple execution modes are available for each of the project's activity and with minimization of makespan as objective. We present a new genetic algorithm approach in order to solve this problem. In this procedure, we propose a new mutation operator that exploits a critical path and two new local search procedures, i.e. critical path improvement local search (cpiLS) and iterative forward/backward local search (ifbLS), using activity list characteristics. The cpiLS reduces the critical path and the ifbLS improves resource allocation of the schedule of rc-PSP/mM. Also, to evaluate the proposed approach, we compare the results of the computational experiment on certain standard project instances with the several competing heuristic procedures presented in the literature, and it has been revealed that our procedure is one of the most competitive among the algorithms. (c) 2014 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

    DOI

  • ものの移動実績情報入力を利用したスパイラル進化型スケジューリングシステム

    藤村 茂

    電気学会研究会資料 システム研究会, ST-14-001    2014年02月

  • A Reference Model for Development of Production Scheduling Systems

    Shigeru Fujimura

    Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management (IEOM)    2014年01月

  • Cellular manufacturing - Heart of the JIT philosophy

    Wei Weng, Shigeru Fujimura

    Proc. of 2013 Asian Conference of Management Science and Applications    2013年12月

  • 大学院の国際化・産学連携への取組 グローバル技術人材育成拠点の創造

    犬島 浩, 藤村 茂

    電気評論   98 ( 12 ) 29 - 33  2013年12月

  • Reducing textile dyeing wastewater using an improved Genetic Algorithm

    Xi Peng, Wei Weng, Shigeru Fujimura

    The 23rd Fuzzy, Artificial Intelligence, Neural Networks and Computational Intelligence    2013年09月

  • An MIP-based approach to solve energy-aware scheduling problem for flexible flow shops

    Fangfang Xu, Wei Weng, Shigeru Fujimura

    The 23rd Fuzzy, Artificial Intelligence, Neural Networks and Computational Intelligence    2013年09月

  • 生産スケジューリング業務のシステム化規範

    藤村 茂

    平成25年電気学会 電子・情報・システム部門大会講演論文集     370 - 373  2013年09月

  • Application of MILP to solve complex scheduling problems

    Wei Weng, Cheng Chen, Shigeru Fujimura

    Proc, of 2nd Pacific Rim Mathematical Association Congress    2013年06月

  • 生産スケジューリング業務のシステム化の現状と課題

    藤村 茂

    電気学会研究会資料 システム研究会, ST-13-021     19 - 24  2013年06月

  • GA Based Optimization Approach for Semiconductor Manufacturing Scheduling Problem

    Song Gao, Xin Wei, Shigeru Fujimura

    電気学会研究会資料 システム研究会, ST-13-009     39 - 43  2013年02月

  • A local Guided Optimization Algorithm for Multi-objective Reentrant Production Line Scheduling Problems

    Xin Wei, Song Gao, Shigeru Fujimura

    電気学会研究会資料 システム研究会, ST-13-008     33 - 38  2013年02月

  • タブーサーチに基づくナーススケジューリングシステム

    沈 東翰, 藤村 茂

    電気学会研究会資料 システム研究会, ST-13-007     29 - 32  2013年02月

  • スパイラル進化型スケジューリングシステム構築手法の適用評価

    菅又 智道, 衛 シン, 藤村 茂

    電気学会研究会資料 システム研究会, ST-13-004     15 - 19  2013年02月

  • Multi-objective optimization approach with job-based encoding method for semiconductor final testing scheduling problem

    Yi Sun, Xin Wei, Shigeru Fujimura, Genke Yang

    Advanced Materials Research   622   152 - 157  2013年

     概要を見る

    The semiconductor final testing scheduling problem (SFTSP) is a variation of the complex scheduling problem, which deals with the arrangement of the job sequence for the final testing process. In this paper, we present an actual SFTSP case includes almost all the flow-shop factors as reentry characteristic, serial and batch processing stages, lot-clusters and parallel machines. Since the critical equipment needs to be utilized efficiently at a specific testing stage, the scheduling arrangement is then playing an important role in order to reduce both the makespan and penalty cost of all late products in total final testing progress. On account of the difficulty and long time it takes to solve this problem, we propose a multi-objective optimization approach, which uses a lot-merging procedure, a new job-based encoding method, and an adjustment to the non-dominated sorting genetic algorithm II (NSGA-II). Simulation results of the adjusted NSGA-II on this SFTSP problem are compared with its traditional algorithm and much better performance of the adjusted one is observed. © (2013) Trans Tech Publications, Switzerland.

    DOI

  • A Fuzzy-based Multi-Term Genetic Algorithm for Reentrant Flow Shop Scheduling Problem

    I-Hsuan Huang, Shigeru Fujimura

    2013 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM 2013)     305 - 309  2013年  [査読有り]

     概要を見る

    In semiconductor manufacturing factories, the process of wafer fabrication is the most technologically complex and capital intensive stage. This process is configured as a reentrant flow shop process with many machines and processing steps. It needs an efficient and effective scheduling method for large size process in order to increase the competitiveness. The reentrant flow shop problem (RFSP) means that all jobs have the same route through the shop machines and the same shop machine is used several times to complete a job. This research provides an effective fuzzy-based multi-term genetic algorithm to solving RFSP with the objective of minimizing the total turn around time (TTAT). The proposed method focuses on the critical point in scheduled solutions. The middle position of longest TAT is defined as the critical point. According to the critical point and current generation, fuzzy logic chooses the focused term of chromosome, then the genetic algorithm effects on this term. In each evolution, only corresponded part of chromosome is evolved by crossover and mutation while other parts of chromosome remain unchanged. Through computational experiments, the effectiveness of the fuzzy-based multi-term genetic algorithm is evaluated.

  • Dynamic routing strategies for JIT production in hybrid flow shops

    Wei Weng, Xin Wei, Shigeru Fujimura

    COMPUTERS & OPERATIONS RESEARCH   39 ( 12 ) 3316 - 3324  2012年12月  [査読有り]

     概要を見る

    In production processes, just-in-time (JIT) completion of jobs helps reduce both the inventory and late delivery of finished products. Previous research which aims to achieve JIT job completion mainly worked on static scheduling problems, in which all jobs are available from time zero or the available time of each job is known beforehand. In contrast, dynamic scheduling problems which involve continual arrival of new jobs are not much researched and dispatching rules remain the most frequently used method for such problems. However, dispatching rules are not high-performing for the JIT objective. This study proposes several routing strategies which can help dispatching rules realize JIT completion for jobs arriving dynamically in hybrid flow shops. The routing strategies are based on distributed computing which makes realtime forecast of completion times of unfinished jobs. The advantages include short computing time, quick response and robustness against disturbance. Computer simulations show that the performance of dispatching rules combined with the proposed routing strategies is significantly higher than that of dispatching rules only and that of dispatching rules combined with the previous routing methods. (c) 2012 Elsevier Ltd. All rights reserved.

    DOI

  • SOLVING A REENTRANT FLEXIBLE JOB SHOP PROBLEM BY USING MIXED INTEGER LINEAR PROGRAMMING

    Cheng Chen, Wei Weng, Shigeru Fujimura

    Proc. of 2nd International Conference on Applied and Theoretical Information Systems Research    2012年12月

  • Heuristic methods to smooth the job flow along a multi-shop production line

    Wei Weng, Cheng Chen, Shigeru Fujimura

    Proc. of 2nd International Conference on Applied and Theoretical Information Systems Research    2012年12月

  • Dynamic routing strategies for JIT production in hybrid flow shops

    Wei Weng, Xin Wei, Shigeru Fujimura

    COMPUTERS & OPERATIONS RESEARCH   39 ( 12 ) 3316 - 3324  2012年12月  [査読有り]

     概要を見る

    In production processes, just-in-time (JIT) completion of jobs helps reduce both the inventory and late delivery of finished products. Previous research which aims to achieve JIT job completion mainly worked on static scheduling problems, in which all jobs are available from time zero or the available time of each job is known beforehand. In contrast, dynamic scheduling problems which involve continual arrival of new jobs are not much researched and dispatching rules remain the most frequently used method for such problems. However, dispatching rules are not high-performing for the JIT objective. This study proposes several routing strategies which can help dispatching rules realize JIT completion for jobs arriving dynamically in hybrid flow shops. The routing strategies are based on distributed computing which makes realtime forecast of completion times of unfinished jobs. The advantages include short computing time, quick response and robustness against disturbance. Computer simulations show that the performance of dispatching rules combined with the proposed routing strategies is significantly higher than that of dispatching rules only and that of dispatching rules combined with the previous routing methods. (c) 2012 Elsevier Ltd. All rights reserved.

    DOI

  • Control methods to complete jobs at desired times

    Wei Weng, Shigeru Fujimura

    International Journal of Information and Electronics Engineering   2 ( 6 ) 907 - 915  2012年11月

  • A Hybrid Quantum-Inspired Genetic Algorithm for multi-objective

    Qicong Shan, Xin Wei, Shigeru Fujimura

    平成24年 電気学会 電子・情報・システム部門大会講演論文集     1847 - 1848  2012年09月

  • A Parallel Quantum Evolutionary Algorithm for Multi-Objective Optimization

    Xin Wei, Shigeru Fujimura

    平成24年 電気学会 電子・情報・システム部門大会講演論文集     1364 - 1369  2012年09月

  • スパイラル進化可能な中小企業向け生産スケジューリングシステム

    藤村 茂

    平成24年 電気学会 電子・情報・システム部門大会講演論文集     440 - 441  2012年09月

  • Implementation of pull system along a production chain

    Wei Weng, Xin Wei, Shigeru Fujimura

    Proc. of 2012 International Conference on Management and Service Science    2012年08月

  • Control methods for dynamic time-based manufacturing under customized product lead times

    Wei Weng, Shigeru Fujimura

    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH   218 ( 1 ) 86 - 96  2012年04月  [査読有り]

     概要を見る

    For manufacturers, the integration of high performance manufacturing with customer-oriented practices plays an important role in improving the performance of their business system. The benefits from such integration can only be maximized when the two parts are designed to work cooperatively. Though previous research has contributed much to manufacturing control algorithms and customer service practices, there has been little consideration of the two parts as a whole; consequently, the methods proposed may not be well supported by the other practices adopted in the system. This study develops production control methods that support a customer-oriented lead time policy, and aims to increase the performance of both manufacturing and customer service. The control methods are proposed for hybrid flow shops handling orders arriving dynamically. Computer simulations are conducted on a large number of problem instances, and the results show that the designed distributed feedback and decision-making functions enable the proposed methods to significantly outperform existing methods in achieving just-in-time (JIT) job completion under customized product lead times. Even taking into account the possible tradeoff between JIT job completion and flow time length, the proposed methods still deliver competitive performance. (C) 2011 Elsevier B.V. All rights reserved.

    DOI

  • Control methods for dynamic time-based manufacturing under customized product lead times

    Wei Weng, Shigeru Fujimura

    European Journal of Operational Research   218 ( 1 ) 86 - 96  2012年04月

  • Multiupdate mode quantum evolutionary algorithm and its applications to combination and permutation problems

    Xin Wei, Shigeru Fujimura

    IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING   7 ( 2 ) 166 - 173  2012年03月  [査読有り]

     概要を見る

    Based on the concept and principles of quantum computing, this paper proposes a new evolutionary algorithm called multiupdate mode quantum evolutionary algorithm (MMQEA). MMQEA, like the other classic evolutionary algorithms, is also characterized by the representation of the individual evaluation function and the population dynamics; however, instead of binary, numeric, or symbolic representation, MMQEA uses two interactional q-bit strings as an individual. Update modes are introduced as a variational operation that evolves the individuals to make a better solution. The proposed individual structure and update modes are inspired by quantum entanglement. Update modes perform as reproducing the states of a pair of q-bit strings of individual simultaneously. For guiding the individual evolution to maintain the population diversity and avoid prematurity, each q-bit string of individual provides its evolutionary history information to another. To demonstrate its effectiveness and applicability, the proposed algorithm was tested on two famous combinatorial optimization problems, namely, the knapsack problem and flow shop problem. The results show that MMQEA performs very well compared to quantum evolutionary algorithm (QEA) and the conventional genetic algorithm. (C) 2012 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

    DOI

  • 複数のスケジューリング手法の融合によるスケジューリングソリューション構築手法

    藤村 茂

    電気学会研究会資料 システム研究会, ST-12-010     45 - 50  2012年02月

  • 生産スケジューリング業務プロセスモデリング

    藤村 茂

    電気学会研究会資料 システム研究会, ST-12-001     1 - 3  2012年02月

  • Multi-objective local search combined with NSGA-II for Bi-criteria permutation flow shop scheduling problem

    Xin Wei, Wenqiang Zhang, Wei Weng, Shigeru Fujimura

    IEEJ Transactions on Electronics, Information and Systems   132 ( 1 ) 3 - 41  2012年

     概要を見る

    This paper proposed a multi-objective local search procedure (MOLS). It is combined with NSGA-II for solving bi-criteria PFSP with the objectives of minimizing makespan and maximum tardiness. Utilizing the properties of active blocks for flow shop scheduling problem, neighborhood structures MOINS (multi-objective insertion) and MOEXC (multi-objective exchange) are designed in order to improve efficiency of perturbation. Any perturbation based on MOINS and MOEXC takes effect on different criteria simultaneously. The original idea of MOLS is systematic change neighborhoods in the local search procedure. The search direction of MOLS on an individual is naturally guided by interaction of MOINS and MOEXC. Moreover, there is no need to set parameters in MOLS. The MOLS combined with popular multi-objective evolutionary algorithm NSGA-II (Non-dominated Sorting Genetic Algorithm-II) is called as "NSGA-II- MOLS". To illustrate the efficacy of proposed approach, four different scaled problems are used to test performance of NSGA-II-MOLS. The numerous comparisons show efficacy of NSGA-II-MOLS is better than most of algorithms even with the same number of individual evaluations and parameters setting. © 2012 The Institute of Electrical Engineers of Japan.

    DOI

  • Multiupdate mode quantum evolutionary algorithm and its applications to combination and permutation problems

    Xin Wei, Shigeru Fujimura

    IEEJ Transactions on Electrical and Electronic Engineering   7 ( 2 ) 166 - 173  2012年  [査読有り]

     概要を見る

    Based on the concept and principles of quantum computing, this paper proposes a new evolutionary algorithm called multiupdate mode quantum evolutionary algorithm (MMQEA). MMQEA, like the other classic evolutionary algorithms, is also characterized by the representation of the individual evaluation function and the population dynamics
    however, instead of binary, numeric, or symbolic representation, MMQEA uses two interactional q-bit strings as an individual. Update modes are introduced as a variational operation that evolves the individuals to make a better solution. The proposed individual structure and update modes are inspired by quantum entanglement. Update modes perform as reproducing the states of a pair of q-bit strings of individual simultaneously. For guiding the individual evolution to maintain the population diversity and avoid prematurity, each q-bit string of individual provides its evolutionary history information to another. To demonstrate its effectiveness and applicability, the proposed algorithm was tested on two famous combinatorial optimization problems, namely, the knapsack problem and flow shop problem. The results show that MMQEA performs very well compared to quantum evolutionary algorithm (QEA) and the conventional genetic algorithm. © 2012 Institute of Electrical Engineers of Japan.

    DOI

  • Multiobjective process planning and scheduling using improved vector evaluated genetic algorithm with archive

    Wenqiang Zhang, Shigeru Fujimura

    IEEJ Transactions on Electrical and Electronic Engineering   7 ( 3 ) 258 - 267  2012年

     概要を見る

    Multiobjective process planning and scheduling (PPS) is a most important practical but very intractable combinatorial optimization problem in manufacturing systems. Many researchers have used multiobjective evolutionary algorithms (moEAs) to solve such problems
    however, these approaches could not achieve satisfactory results in both efficacy (quality, i.e., convergence and distribution) and efficiency (speed). As classical moEAs, nondominated sorting genetic algorithm II (NSGA-II) and SPEA2 can get good efficacy but need much CPU time. Vector evaluated genetic algorithm (VEGA) also cannot be applied owing to its poor efficacy. This paper proposes an improved VEGA with archive (iVEGA-A) to deal with multiobjective PPS problems, with consideration being given to the minimization of both makespan and machine workload variation. The proposed method tactfully combines the mechanism of VEGA with a preference for the edge region of the Pareto front and the characteristics of generalized Pareto-based scale-independent fitness function (gp-siff) with the tendency to converge toward the central area of the Pareto front. These two mechanisms not only preserve the convergence rate but also guarantee better distribution performance. Moreover, some problem-dependent crossover, mutation, and local search methods are used to improve the performance of the algorithm. Complete numerical comparisons show that the iVEGA-A is obviously better than VEGA in efficacy, and the convergence performance is also better than NSGA-II and SPEA2, while the distribution performance is comparable to and the efficiency is obviously better than theirs. © 2012 Institute of Electrical Engineers of Japan.

    DOI

  • Parallel Quantum Evolutionary Algorithms with Client-Server Model for Multi-Objective Optimization on Discrete Problems

    Xin Wei, Shigeru Fujimura

    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC)    2012年  [査読有り]

     概要を見る

    This paper proposes a parallel quantum evolutionary algorithm (PQEA) using Client-Server model for multi-objective optimization problems. Firstly, the PQEA uniformly decomposes a multi-objective optimization problem into a number of scalar optimization sub-problems. All the sub-problems are classified into several groups according to their similarities. Each "Client" processes the evolution for a group of neighbor sub-problems in parallel. There is a quantum individual used to address the sub-problems of a group in a "Client". Since the quantum individual is a probabilistic representation, it can share evolutionary information of the neighbor sub-problems in one group, while the sub-problems are orderly solved using a same q-bit individual. The "Server" maintains non-dominated solutions that are generated by every "Client". The current best solution for each sub-problem can be found in the "Server", when the quantum individual updated its states for evolution. Experimental results have demonstrated that PQEA obviously outperforms the most famous multi-objective optimization algorithms MOEA/D on the bi-objectives. For the more objectives, the PQEA obtains the similar results with MOEA/D, even with the same evaluation times. Furthermore, in this paper, the scalability and sensitivity of PQEA have also been experimentally investigated.

  • 産学連携プロジェクトが生み出した次世代生産情報システム バーコード実績データ入力による生産スケジューリングシステム導入方法の変革

    藤村 茂

    月刊自動認識   24 ( 12 ) 1 - 4  2011年12月

  • 重み区別指定に基づくナーススケジューリング

    徐 殷, 藤村 茂

    平成23年電気学会 電子・情報・システム部門大会講演論文集     1603 - 1604  2011年09月

  • Hybrid genetic algorithm for multi-depot vehicle routing problem with capacity and route duration constraints

    Sungoh Cho, Shigeru Fujimura

    平成23年電気学会 電子・情報・システム部門大会講演論文集     1178 - 1183  2011年09月

  • ビジネスプロセスモデリングに基づく生産スケジューリングシステムの開発方法論

    藤村 茂

    平成23年電気学会 電子・情報・システム部門大会講演論文集     278 - 283  2011年09月

  • Genetic Algorithm With Critical Path Improvement Strategy For Solving Resource-Constrained Project Scheduling Problem With Multiple Modes

    I. Okada, X.F. Zhang, H.Y. Yang, W.Q. Zhang, S. Fujimura

    Proceedings of the 21st International Conference on Production Research (ICPR21)    2011年08月

  • Fast and effective evolutionary algorithm for multiobjective process planning and scheduling problem

    Wenqiang Zhang, Xin Wei, Shigeru Fujimura

    Proceedings of the 21st International Conference on Production Research (ICPR21)    2011年08月

  • Hybrid bi-criterion evolutionary algorithm for permutation flow shop scheduling problem

    Xin Wei, Shigeru Fujimura

    Proceedings of the 21st International Conference on Production Research (ICPR21)    2011年08月

  • Development Methodology for Production Scheduling Systems using Business Process Modeling

    Shigeru Fujimura

    Proceedings of the 21st International Conference on Production Research (ICPR21)    2011年08月

  • Cooperated Integration Framework of Production Planning and Scheduling based on Order Life-cycle Management

    Shigeru Fujimura

    Proceedings of the Workshop on Knowledge Engineering for Planning and Scheduling     71 - 76  2011年06月

  • Study and Application of Scheduling Method for Just-in-time Production in Flexible Job Shops

    Wei Weng, Shigeru Fujimura

    2011 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM)     318 - 322  2011年  [査読有り]

     概要を見る

    The unsmooth job flow between the production shops along a manufacturing chain is a problem commonly seen in industries due to the inconsistency in processing speed and delivery between the chained production shops. With many factors involved in the coordination between production shops, the problem is complex and few solutions have been provided to date. This study presents an approach able to solve this problem by implementing time-based manufacturing that enables the speed and timing of each shop's job outflow to match those of its successor shop's job inflow. The proposed method is composed of offline schedule making and online job processing control. It aims to complete each job in a just-in-time (JIT) manner at the time the job is wanted by the next production shop. Designed upon a flexible job shop environment, which is easy to be transformed into other shops with similar characters, the proposed method is expected to be widely applicable to JIT scheduling problems. An industrial case study is made and results show that the proposed method has a strong ability in JIT job completion, tardy job prevention and makespan reduction.

  • A production control system with application to job shop just-in-time manufacturing

    Wei Weng, Shigeru Fujimura

    8th International Conference on Optimization: Techniques and Applications    2010年12月

  • Distributed-Intelligence Approaches for Weighted Just-in-Time Production

    Wei Weng, Shigeru Fujimura

    IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING   5 ( 5 ) 560 - 568  2010年09月  [査読有り]

     概要を見る

    This paper considers the dynamic flexible-flow shop scheduling problem in which the manufacturing environment consists of multiple stages with multiple machines at each stage. All jobs must go through all stages in sequence in order to become a product, and the processing time for each product on each machine is different. There exists a delivery time between machines of neighboring stages, and the release time of each job is unknown, which means that a new job may be released into the system at any time. The objective of this work is to minimize the total earliness and tardiness penalties of all jobs, or to achieve just-in-time production. Previous researches did much on the static scheduling of such problem with different objectives, whereas little effort has been made on dynamic scheduling for such problem, which is more difficult than the static problem but becomes more and more important under the increasingly competitive manufacturing industry. Therefore, to address such need, efforts are been made on dynamic scheduling and several distributed-intelligence approaches are proposed in this paper. Featured by concurrent computing, the distributed-intelligence approaches have been tested on two different manufacturing environments, whose result tells that the proposed approaches deliver competitive performance for the targeted problem. (C) 2010 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

    DOI

  • 生産時間の変動を考慮した利用資源の平準化に関する研究

    山田 一寿, 藤村 茂

    平成22年電気学会 電子・情報・システム部門大会講演論文集     1242 - 1245  2010年09月

  • オーダライフサイクルマネジメントと生産スケジューリングの融合

    藤村 茂, 福井 淳

    平成22年電気学会 電子・情報・システム部門大会講演論文集     302 - 306  2010年09月

  • バッチプロセス産業におけるオーダライフサイクルマネジメントと生産スケジューリングの融合

    藤村 茂

    スケジューリング・シンポジウム2010    2010年09月

  • 業務プロセスモデリングによる生産管理のためのシステム開発

    藤村 茂

    平成23年電気学会全国大会シンポジウム    2010年09月

  • Conception of Self-Construction Production Scheduling System

    Hai Xue, Xuerui Zhang, Yasuhiro Shimizu, Shigeru Fujimura

    ELECTRONICS AND COMMUNICATIONS IN JAPAN   93 ( 1 ) 19 - 29  2010年01月  [査読有り]

     概要を見る

    With the high speed innovation of information technology, many production scheduling systems have been developed. However, a lot of customization according to individual production environment is required, and then a large investment for development and maintenance is indispensable. Therefore now the direction to construct scheduling systems should be changed. The final objective of this research aims at developing a system which is built by it extracting the scheduling technique automatically through the daily production scheduling work, so that an investment will be reduced. This extraction mechanism should be applied for various production processes for interoperability. Using the master information extracted by the system, production scheduling operators can be supported to accelerate the production scheduling work easily and accurately without any restriction of scheduling operations. By installing this extraction mechanism, it is easy to introduce a scheduling system without a lot of expense for customization. In this paper, first a model for expressing a scheduling problem is proposed. Then the guideline to extract the scheduling information and use the extracted information is shown and some applied functions are also proposed based on it. (C) 2009 Wiley Periodicals, Inc. Electron Comm Jpn, 93(1): 19-29, 2010; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecj.10188

    DOI

  • Conception of Self-Construction Production Scheduling System

    Hai Xue, Xuerui Zhang, Yasuhiro Shimizu, Shigeru Fujimura

    ELECTRONICS AND COMMUNICATIONS IN JAPAN   93 ( 1 ) 19 - 29  2010年01月  [査読有り]

     概要を見る

    With the high speed innovation of information technology, many production scheduling systems have been developed. However, a lot of customization according to individual production environment is required, and then a large investment for development and maintenance is indispensable. Therefore now the direction to construct scheduling systems should be changed. The final objective of this research aims at developing a system which is built by it extracting the scheduling technique automatically through the daily production scheduling work, so that an investment will be reduced. This extraction mechanism should be applied for various production processes for interoperability. Using the master information extracted by the system, production scheduling operators can be supported to accelerate the production scheduling work easily and accurately without any restriction of scheduling operations. By installing this extraction mechanism, it is easy to introduce a scheduling system without a lot of expense for customization. In this paper, first a model for expressing a scheduling problem is proposed. Then the guideline to extract the scheduling information and use the extracted information is shown and some applied functions are also proposed based on it. (C) 2009 Wiley Periodicals, Inc. Electron Comm Jpn, 93(1): 19-29, 2010; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecj.10188

    DOI

  • Multi-update Mode Quantum Evolutionary Algorithm For A Combinatorial Problem

    Wei Xin, Fujimura Shigeru

    2010 2ND INTERNATIONAL CONFERENCE ON COMPUTER AND AUTOMATION ENGINEERING (ICCAE 2010), VOL 2     281 - 285  2010年  [査読有り]

     概要を見る

    This paper proposed a new evolutionary algorithm based on concept and principles of quantum computing, called Multi-update Mode Quantum Evolution Algorithm (MMQEA), in which having two update modes beta-update and beta-update, and between their modes each update procedure provide its evolutionary information to other one, that to guide the other update-mode to maintain the population diversity and avoid premature. Meanwhile in MMQEA, proposed a new individual structure that composed by two Q-bit strings. Applying the multi-update mode to individual evolution improved the Q-gate updating efficiency in each generation of MMQEA. To demonstrate its effectiveness and applicability, the proposed algorithms were tested on a famous combinatorial optimization problem, the knapsack problem. The results show that MMQEA performs very well compared with Quantum Evolutionary Algorithm (QEA).

  • A Random Key-based Genetic Algorithm Approach for Resource-constrained Project Scheduling Problem with Multiple Modes

    I. Okada, X. F. Zhang, H. Y. Yang, S. Fujimura

    INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS (IMECS 2010), VOLS I-III     106 - +  2010年  [査読有り]

     概要を見る

    In the practice of scheduling of construction projects, there is a great variety of methods and procedures that need to be selected at each construction process during project. Accordingly, it is important to consider the different modes that may be selected for an activity in the scheduling of construction projects. In this study, first, we mathematically formulate the resource-constrained project scheduling problem with multiple modes while minimizing the total project time as the objective function. Following, we propose a new random key-based genetic algorithm approach which includes the mode reduction procedures to solve this NP-hard optimization problem. Finally, in order to evaluate the performance of our method, we are scheduled in the close future to implement the proposed approach on some standard project instances as the computational experiment and analyze these experimental results comparing with the bi-population-based genetic algorithm by Peteghem and Vanhoucke [1].

  • Flexible flow shop scheduling by intelligent multi-agents

    Wei Weng, Shigeru Fujimura

    8th ACIS International Conference on Software Engineering Research, Management and Applications, SERA 2010     113 - 120  2010年

     概要を見る

    This paper presents some important improvements to a previously proposed intelligent production system dealing with a dynamic flexible flow shop scheduling problem under a multi-stage multi-machine factory environment. These improvements greatly help upgrade the overall system performance under stable demand situations as well as under fluctuated demand situations, build the system robust against demand increase, and raise the systems machine utilization rate. The research objective is to minimize the total earliness and tardiness penalties of all jobs during any given period of time. The system works on the basis of multi-agent feedbacks that are conducted by agents which collect realtime information, make decisions, and work interactively to give corresponding solutions to each job. Comparison between the previous system and the improved one has been carried out, and the experimental results demonstrate the effectiveness of the proposed improvements under various system situations. © 2010 IEEE.

    DOI

  • Improved vector evaluated genetic algorithm with archive for solving multiobjective PPS problem

    Wenqiang Zhang, Shigeru Fujimura

    2010 International Conference on E-Product E-Service and E-Entertainment, ICEEE2010    2010年

     概要を見る

    The process planning and scheduling (PPS) is to determine a solution (schedule), which tells a production facility what to make, when, and on which equipment, to process a set of parts with operations effectively. Multiobjective PPS problems become more complex because the decision maker need to make a trade-off between two or more objectives while determining a set of optimal nondominated solutions effectively. The previous research works use evolutionary algorithms (EA) to solve such problems, however, the proposed approaches cannot get a good balance between efficacy and efficiency. This paper proposed an improved vector evaluated genetic algorithm with archive (iVEGA-A) mechanism to deal with PPS problem while considering the minimization of the makespan and minimization of the variation of workload of machine. The proposed algorithm has been compared with other approaches to verify and benchmark the optimization reliability on PPS problems. These comparisons indicate iVEGA-A is better than vector evaluated genetic algorithm (VEGA) did on efficacy and negligible difference on efficiency. The efficacy is not less than some famous approaches, such as, nondominated sorting genetic algorithm II (NSGA-II) and strength Pareto evolutionary algorithm 2 (SPEA2) and the efficiency is obviously better than the latter. ©2010 IEEE.

    DOI

  • Multi-Objective Quantum Evolutionary Algorithm for Discrete Multi-Objective Combinational Problem

    Xin Wei, Shigeru Fujimura

    INTERNATIONAL CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI 2010)     39 - 46  2010年  [査読有り]

     概要を見る

    Weighted linear scalar, which transfers a multi-objective problem to many single objective sub-problems, is a basic strategy in traditional multi-objective optimization. However, it is not well used in many multi-objective evolutionary algorithms because of most of them are lack of balancing between exploitation and exploration for all sub-problems. This paper proposes a novel multi-objective evolutionary algorithm called multi-objective quantum evolutionary algorithm (MOQEA). Quantum evolutionary algorithm is a recent developed heuristic algorithm, based on the concept of quantum computing. The most merit of QEA is that it has little q-bit individuals are evolved to obtain an acceptable result. MOQEA decomposes a multi-objective optimization problem into a number of scalar optimization sub-problems and optimizes them simultaneously. Each sub-problem is optimized by one q-bit individual. The neighboring solutions that are defined as a set of nondominated solutions of sub-problem are generated from the corresponding q-bit individual. The experimental results have demonstrated that MOQEA outperforms or performs similarly to MOGLS and NSGA-II on discrete multi-objective problems.

    DOI

  • Improved vector evaluated genetic algorithm with archive for solving multiobjective PPS problem

    Wenqiang Zhang, Shigeru Fujimura

    2010 International Conference on E-Product E-Service and E-Entertainment, ICEEE2010     1100 - 1103  2010年

     概要を見る

    The process planning and scheduling (PPS) is to determine a solution (schedule), which tells a production facility what to make, when, and on which equipment, to process a set of parts with operations effectively. Multiobjective PPS problems become more complex because the decision maker need to make a trade-off between two or more objectives while determining a set of optimal nondominated solutions effectively. The previous research works use evolutionary algorithms (EA) to solve such problems, however, the proposed approaches cannot get a good balance between efficacy and efficiency. This paper proposed an improved vector evaluated genetic algorithm with archive (iVEGA-A) mechanism to deal with PPS problem while considering the minimization of the makespan and minimization of the variation of workload of machine. The proposed algorithm has been compared with other approaches to verify and benchmark the optimization reliability on PPS problems. These comparisons indicate iVEGA-A is better than vector evaluated genetic algorithm (VEGA) did on efficacy and negligible difference on efficiency. The efficacy is not less than some famous approaches, such as, nondominated sorting genetic algorithm II (NSGA-II) and strength Pareto evolutionary algorithm 2 (SPEA2) and the efficiency is obviously better than the latter. ©2010 IEEE.

    DOI

  • Multi-Agent Scheduling for Machine Breakdown and Recovery

    Wei Weng, Shigeru Fujimura

    20th International Conference on Production Research (ICPR 20), Shanghai, China     chapter 2 - No.41  2009年08月

  • SIMULATION MODELING OF AUTOMATED GUIDED VEHICLE SYSTEM BASED ON JIT PHILOSOPHY

    Zheng Yao, Shigeru Fujimura

    20th International Conference on Production Research (ICPR 20), Shanghai, China     67  2009年08月

  • MULTI-PATH TABU SEARCH METHOD FOR JOB SHOP SCHEDULING PROBLEM

    Zheng Yao, Shigeru Fujimura

    20th International Conference on Production Research (ICPR 20), Shanghai, China     73  2009年08月

  • A STUDY ON RESOURCE LEVELING UNDER UNCERTAIN PROCESSING TIME

    Kazuhisa Yamada, Shigeru Fujimura

    20th International Conference on Production Research (ICPR 20), Shanghai, China     106  2009年08月

  • Intelligent Production Control System for Multi-Machines

    Wei Weng, Shigeru Fujimura

    International Symposium on Scheduling 2009 (ISS 2009), Nagoya, Japan     91 - 96  2009年07月

  • A Study on Dynamic Vehicle Routing Problem with Split Delivery

    Jizen Sou, Shigeru Fujimura

    International Conference on Intelligent Manufacturing & Logistics Systems IML2009, Kitakyushu, Japan    2009年02月

  • Study on A Taboo Search with A New Hybrid Neighborhood Structure for Job Shop Scheduling Problem

    Dewei Xing, Shigeru Fujimura

    International Conference on Intelligent Manufacturing & Logistics Systems IML2009, Kitakyushu, Japan    2009年02月

  • Dynamic Scheduling for Multi-Machines with Machine Addition and Removal

    Wei Weng, Shigeru Fujimura

    International Conference on Intelligent Manufacturing & Logistics Systems IML2009, Kitakyushu, Japan     67 - 72  2009年02月

  • Scheduling of Worker Allocation in the Manual Labor Environment with Genetic Algorithm

    Sicong Tan, Wei Weng, Shigeru Fujimura

    IMECS 2009: INTERNATIONAL MULTI-CONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II     70 - 75  2009年  [査読有り]

     概要を見る

    Worker allocation problem of the manual labor factory consists in deciding who does what during the manual labor production. Manual labor factory, has concern for reducing the production duration, human cost and overwork. A novel scheduling model of worker allocation problem for manual labor is proposed in this paper. Given a set of jobs and a set of workers, worker allocation problem is to assign the workers into these jobs to reduce human cost, to shorten production duration and control production overwork. Worker allocation problem is a very important issue in the production scheduling, since total budget and human resource involved must be managed optimally. Worker allocation problem is NP-Hard problem to find optimal solution as increasing worker number and enlarging production scale. Genetic algorithm (GA) is considered a promising method so in this paper worker allocation problem is solved by using genetic algorithm. This paper shows it is very flexible and accurate for finding near-optimal solutions in the short time.

  • Online Scheduling of Flexible Flow Shop Manufacturing

    Wei Weng, Shigeru Fujimura

    INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION, VOL 1, PROCEEDINGS   1   112 - 116  2009年  [査読有り]

     概要を見る

    The flexible flow shop refers to such a manufacturing environment in which jobs are to be processed through serial stages, with one or multiple machines available at each stage. It is usually a complex task when specific objective is demanded such as minimum cost, minimum time, etc. Static scheduling of such problems has been much researched, however, little efforts have been made on real-time scheduling when the release time of each job is unknown. In this paper, some online scheduling methods are presented to deal with the tough problem of real-time Just-In-Time manufacturing. In addition to applicable dispatching rules, agent-based approaches are also proposed featuring feedback learning, and realtime prediction. The simulation result reveals that the presented distributed learning approach, especially when combined with realtime prediction, delivers a high performance.

    DOI

  • Distributed Feedback Mechanism for Just-In-Time Scheduling Problem

    Wei Weng, Shigeru Fujimura

    PROCEEDINGS OF THE 8TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE     15 - 20  2009年  [査読有り]

     概要を見る

    The problem considered in this research is the just-in-time scheduling of a manufacturing environment that is able to produce several different products. New jobs come randomly into the system, expected to become one of the products. Each job must go through multiple stages before it can be finished as a product There are multiple machines at each stage, and the processing time of each product on each machine is different There exits delivery time between stages. Previous researches did much on the static scheduling of such problem by using mixed integer linear programming. However, little efforts have been made on realtime scheduling, which means the release time of jobs is unknown. But such scheduling is becoming more and more important under the increasingly competitive manufacturing market In this paper, two distributed feedback mechanisms are proposed to solve the realtime scheduling problem of minimizing earliness and tardiness penalties of all jobs. The simulation shows that the proposed distributed feedback mechanisms deliver quite competitive performance for the targeted problem.

    DOI

  • Self Evolution Algorithm to Minimize Earliness and Tardiness Penalties with a Common Due Date on a Single Machine

    Wei Weng, Shigeru Fujimura

    IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING   3 ( 6 ) 604 - 611  2008年11月

     概要を見る

    Earliness and tardiness penalties are designed for Such scheduling problems where the popular Just-In-Time (JIT) concept is considered to be of significant importance. In this paper, a self evolution (SE) algorithm is proposed to solve the problem of single-machine total earliness and tardiness penalties with a common due date. Up to now, no specific attention has been paid to straddling V-shaped schedules of such problems, which may be better than pure V-shaped schedules for the early due date cases; and no specific discussions have been made on the start time setting of the first job in a schedule. Therefore, in this research, efforts have been made on digging out the straddling V-shaped schedules, improving the efficiency of setting the start time of a schedule, and reducing the execution time. In addition, a new RHRM approach is proposed to create the initial solution for evolution, which helps in achieving the fast contingency of the algorithm. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs from the OR Library, and the results show that the proposed SE algorithm delivers much higher efficiency in finding optimal or near-optimal solutions with both better results in total penalties and significant execution time reduction. (C) 2008 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

    DOI

  • 自己構築型生産スケジューリングシステムの構想

    薛 海, 張 学睿, 清水 康弘, 藤村 茂

    電気学会論文誌C   128-C  2008年04月

  • Study On Neighborhood Structures and Tabu Search for Job Shop Scheduling

    Zheng Yao, Shigeru Fujimura

    Asia Conference on Intelligent Manufacturing & Logistics Systems, Kitakyushu, Japan     231 - 236  2008年02月

  • Evaluation of R-B Advanced Available-to-promise

    Chui-Hui, Shigeru Fujimura

    Asia Conference on Intelligent Manufacturing & Logistics Systems, Kitakyushu, Japan     223 - 230  2008年02月

  • Memorial Self Evolution Algorithm to Solve JIT Machine Scheduling Problem

    Wei Weng, Shigeru Fujimura

    2008 6TH IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL INFORMATICS, VOLS 1-3     1604 - 1609  2008年  [査読有り]

     概要を見る

    The Just-In-Time (JIT) concept is of great importance in many manufacturing processes. JIT scheduling problems affects the performance of the whole production procedure, because early in job completion causes inventory cost while delay in job completion raises penalties paid to customers. In this paper, a memorial self evolution algorithm is proposed to solve the problem of total earliness and tardiness penalties on a machine unit with a common due date. Up to now, researches on this problem have paid no specific attention to straddling V-shaped schedules, which may be better than pure V-shaped schedules for early due date cases; and no specific discussions have been made on the start time setting of the first job in a schedule. Thus, efforts have been made on searching good straddling V-shaped schedules, and optimizing start time setting of schedules. A GHRM approach is proposed to create the initial solution for memorial self evolution. Meanwhile a database which keeps the memories of the elite solutions is introduced to deliver better initial solutions for similar problems. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs. The results show that the proposed memorial self evolution algorithm delivers better results in in finding optimal or near-optimal solutions than previous researches.

  • Memorial Self Evolution Algorithm to Solve JIT Machine Scheduling Problem

    Weng Wei, Fujimura Shigeru

    IEEE International Conference on Industrial Informatics (INDIN)     1706 - 1711  2008年

     概要を見る

    The Just-In-Time (JIT) concept is of great importance in many manufacturing processes. JIT scheduling problems affects the performance of the whole production procedure, because early in job completion causes inventory cost while delay in job completion raises penalties paid to customers. In this paper, a memorial self evolution algorithm is proposed to solve the problem of total earliness and tardiness penalties on a machine unit with a common due date. Up to now, researches on this problem have paid no specific attention to straddling V-shaped schedules, which may be better than pure V-shaped schedules for early due date cases
    and no specific discussions have been made on the start time setting of the first job in a schedule. Thus, efforts have been made on searching good straddling V-shaped schedules, and optimizing start time setting of schedules. A GHRM approach is proposed to create the initial solution for memorial self evolution. Meanwhile a database which keeps the memories of the elite solutions is introduced to deliver better initial solutions for similar problems. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs. The results show that the proposed memorial self evolution algorithm delivers better results in in finding optimal or near-optimal solutions than previous researches.©2008 IEEE.

    DOI

  • Self Evolution Algorithm for Common Due Date Scheduling Problem

    Wei Weng, Shigeru Fujimura

    2008 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING, VOLS 1 AND 2     790 - 795  2008年  [査読有り]

     概要を見る

    Inventory cost and delay penalty are two kinds of annoying spendings in manufactory industry. Accordingly, earliness and tardiness penalties are proposed to simulate such scheduling problems where the popular just-in-time (JIT) concept is considered to be of significant importance. In this paper, a self evolution algorithm is proposed to solve the problem of single machine total earliness and tardiness penalties with a common due date. Up to now, such problem has been solved without specific consideration of straddling V-shaped schedules, which may be better than pure V-shaped schedules for early due date problems; without specific discussions on g improving, where g refers to the idle time before the start of the first job; and the many individuals in all so far proposed GA-like algorithms become the bottleneck of execution time reduction. Therefore, in this research, efforts have been made on digging out the straddling V-shaped schedules, improving the efficiency of g improving, and reducing the execution time. In addition, a new RHRM approach is proposed to create the initial solution for evolution, which helps achieve the fast contingency of the algorithm. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs from the OR Library, the results showing that the proposed self evolution algorithm delivers much higher efficiency in finding optimal or near-optimal solutions with both better results in total penalties and significant execution time reduction.

  • Project Management for Effective Use of Slack Time

    Jung, ruei-bin, Shigeru Fujimura

    The 8th Asia Pacific Industrial Engineering & Management System and 2007 Chinese Institute of Industrial Engineers Conference , Kaohsiung Taiwan    2007年12月

  • Customer Order Synchronization Framework Using CSCW Principles

    Wu, Chin-Hui, Enrique Valerio, Shigeru Fujimura

    The 8th Asia Pacific Industrial Engineering & Management System and 2007 Chinese Institute of Industrial Engineers Conference , Kaohsiung Taiwan    2007年12月

  • マルチエージェントを用いた高速道路料金所の車両挙動シミュレータの開発

    山下 順也, 藤村 茂

    平成19年電気学会 電子・情報・システム部門大会講演論文集     1024 - 1030  2007年09月

  • 自己構築型生産スケジューリングシステム実現に向けたユーザ操作から抽出されたスケジューリング情報の汎用化

    柴田 知樹, 張 学睿, 藤村 茂

    平成19年電気学会 電子・情報・システム部門大会講演論文集     1109 - 1114  2007年09月

  • Dynamic Local Focusing Approach for Job Shop Scheduling Problems

    Ping Gu, Yajie Lou, Xuerui Zhang, Shigeru Fujimura

    平成19年電気学会 電子・情報・システム部門大会講演論文集     1098 - 1102  2007年09月

  • 混合品種組立てラインにおけるユーティリティ作業時間を考慮した製品投入順序決定手法

    村山 隆志, 金 昇, 藤村 茂

    平成19年電気学会 電子・情報・システム部門大会講演論文集     1092 - 1097  2007年09月

  • ベイジアンネットワークを用いた生産スケジュールの評価手法

    石橋 浩二, 藤村 茂

    平成19年電気学会 電子・情報・システム部門大会講演論文集     537 - 540  2007年09月

  • 代替機械を利用したスケジュール調整手法の実現

    禹 棋允, 藤村 茂

    平成19年電気学会 電子・情報・システム部門大会講演論文集     524 - 529  2007年09月

  • A Study on Dynamic Vehicle Scheduling Problem with Stochastic Demand Environment

    Jizen Sou, Hiroshi Katayama, Shigeru Fujimura

    The 3rd International Congress on Logistics and SCM Systems    2007年08月

  • A Decomposition Approach for Job Shop Scheduling Problems Focused on The Longest Active Chain

    Yajie Lou, Xuerui Zhang, Shigeru Fujimura

    the 19th International Conference on Production Research, Valparaiso, Chile   ( Th1.3 )  2007年08月

  • Optimal Approach for an Effective Customer Order Synchronization using CSCW Principles

    Enrique Valerio, Shigeru Fujimura

    the 19th International Conference on Production Research, Valparaiso, Chile   ( Tu1.4 )  2007年08月

  • Reactive Scheduling Algorithm Using Alternative Machines

    Ki-Yun Woo, Koichiro Takamasu, Sung-Chul Cho, Shigeru Fujimura

    International Conference on Electrical Engineering 2007, Hong Kong, China    2007年07月

  • DBRスケジューリングにおけるバッファサイズ決定手法

    朴 淳英, 禹 棋允, 藤村 茂

    電気学会論文誌C   127-C   416 - 424  2007年03月

  • A Decomposition Scheduling Approach focused on the Longest Active Chain

    Yajie Lou, Xuerui Zhang, Shigeru Fujimura

    International Conference on Intelligent Manufacturing & Logistics Systems, IML 2007   ( MP2a-2 ) 138 - 143  2007年02月

  • Autonomous Distributed Scheduling Adjustment Function considering Set- Up Times with Optimum Moving Method

    Sung-Chul Cho, Koichiro Takamasu, Ki-Yun Woo, Shigeru Fujimura

    International Conference on Intelligent Manufacturing & Logistics Systems, IML 2007     374 - 381  2007年02月

  • Scheduling Adjustment Function for Autonomous Distributed Production System

    Koichiro Takamasu, Sung-Chul Cho, Ki-Yun Woo, Shigeru Fujimura

    International Conference on Intelligent Manufacturing & Logistics Systems, IML 2007     368 - 373  2007年02月

  • Reactive Optimum Scheduling Function using Alternative Machine

    Ki-Yun Woo, Koichiro Takamasu, Sung-Chul Cho, Shigeru Fujimura

    International Conference on Intelligent Manufacturing & Logistics Systems, IML 2007   ( MA3a-1 ) 43 - 45  2007年02月

  • Generalization of scheduling information acquired through user manipulation for self-construction production scheduling system

    Tomoki Shibata, Xuerui Zhang, Xue Hai, Yasuhiro Shimizu, Shigeru Fujimura

    2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING, VOLS 1-3   ( SuRP-A01.6 ) 853 - 858  2007年  [査読有り]

     概要を見る

    With the high speed innovation of information technology, many production scheduling systems (to support scheduling work) have been developed. However, a significant customization according to individual production environment is required, and then a large investment for development and maintenance is indispensable. Therefore now the direction to construct scheduling systems should be changed. The final objective of this research aims at developing a system which is built by itself extracting the scheduling technique automatically through the daily production scheduling work. By using the information extracted by the system, production scheduling operators can be supported to accelerate the production scheduling work easily and accurately without any restriction of scheduling works. In order to realize such a production scheduling system, the mechanism to extract scheduling information is needed. In this paper, using Gantt Chart Interface System that is developed to emulate the production scheduling work on papers through the analysis of operator's works, the method extracting and generalizing the relation information between operations from user manipulation is proposed. And the operator assistant function which uses the extracted information is proposed. Then by conducting experiment that uses the assistant function, the availability of the method of extracting and generalizing is shown.

  • Dynamic local focusing approach for production scheduling problems

    Ping Gu, Yajie Lou, Xuerui Zhang, Shigeru Fujimura

    2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING, VOLS 1-3   ( MoRP-A02.6 ) 792 - 797  2007年  [査読有り]

     概要を見る

    Although decomposition procedure is a common approach to handle computational complexity which is caused by large scale production scheduling problems, in order to extend the applicability of the decomposition approach, the overall problem should be decomposed on which criterion is always a problem. Also how to improve decomposition approach's computational efficiency and resultant effectiveness is still a challenging task in this field.
    With the purpose of improving decomposition approach's efficiency and decreasing computational complexity for job shop scheduling problems, a new dynamic local focusing approach which has a machine-based divided criterion focused on the longest active chain is proposed in this paper. Not liking the used decomposition procedure, the proposed one does not decompose a job shop into cells at the very beginning. It dynamically classifies the machines, which process operations on the identified longest active chain of the whole problem as one focused cell (decomposed sub-problem). The schedule is improved by redefining, adjusting and solving the focused cell schedule which is updated iteratively with the entire schedule's longest active chain in this dynamic procedure. The proposed approach is tested on make-span minimum benchmark job shop scheduling problems. Test results show that the algorithm is capable of efficiently generating good schedules.

  • 作業投入順序入替による自律分散スケジュール調整機能

    高増 弘一郎, 禹 棋允, 趙 性, 藤村 茂

    平成18年電気学会 電子・情報・システム部門大会講演論文集     981 - 986  2006年09月

  • 代替機械を利用したスケジュール調整処理手順

    禹 棋允, 高増 弘一郎, 趙 性, 藤村 茂

    平成18年電気学会 電子・情報・システム部門大会講演論文集     978 - 980  2006年09月

  • Master Information Extraction Mechanism for Production Scheduling System

    Hai Xue, XueRui Zhang, Yasuhiro Shimizu, Shigeru Fujimura

    International Conference on Electrical Engineering 2006, YongPyong Resort, Korea   ( EC1-10 )  2006年07月

  • An Efficient Approach for Negotiation Using Due Date in a Supply Chain Network

    Danxia Zhang, Yajie Lou, Shigeru Fujimura

    International Conference on Electrical Engineering 2006, YongPyong Resort, Korea   ( EC1-09 )  2006年07月

  • SCM Construction Model with providing Production Capability

    Shigeru Fujimura, Junsuke Shigechi

    International Conference on Logistics and Supply Chain Management 2006, Hong Kong, China    2006年01月

  • Autonomous distributed scheduling adjustment function with interchanging operations

    Sung-Chul Cho, Ki-Yun Woo, Koichiro Takamasu, Shigeru Fujimura

    2006 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING, VOLS 1 AND 2   ( EC1-11 ) 387 - +  2006年  [査読有り]

     概要を見る

    This paper deals with the partial scheduling adjustment in the autonomous distributed scheduling method. The scheduling adjustment for the production system is required when uncertainty occurs. In that case, it does not need to adjust the whole schedule, but only the partial schedule which receives a direct influence by uncertainty according to the variable situation. From the viewpoint of the distributed system, to implement a function which adjusts such a partial schedule, each machine needs to manage schedule and exchange information. It has been studied by some researchers in recent years. However, the partial scheduling adjustment has not been controlled to change the processing sequence of operations in a machine, namely interchanging operations. Therefore, we propose realizing a function interchanging operations in a machine to diminish the influence occurred by a delay of a certain operation.

  • Autonomous distributed scheduling adjustment function with interchanging operations

    Sung-Chul Cho, Ki-Yun Woo, Koichiro Takamasu, Shigeru Fujimura

    2006 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING, VOLS 1 AND 2     387 - +  2006年  [査読有り]

     概要を見る

    This paper deals with the partial scheduling adjustment in the autonomous distributed scheduling method. The scheduling adjustment for the production system is required when uncertainty occurs. In that case, it does not need to adjust the whole schedule, but only the partial schedule which receives a direct influence by uncertainty according to the variable situation. From the viewpoint of the distributed system, to implement a function which adjusts such a partial schedule, each machine needs to manage schedule and exchange information. It has been studied by some researchers in recent years. However, the partial scheduling adjustment has not been controlled to change the processing sequence of operations in a machine, namely interchanging operations. Therefore, we propose realizing a function interchanging operations in a machine to diminish the influence occurred by a delay of a certain operation.

  • Self-construction production scheduling system

    Xuerui Zhang, Xue Hai, Yasuhiro Shimizu, Shigeru Fujimura

    2006 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING, VOLS 1 AND 2     519 - +  2006年  [査読有り]

     概要を見る

    At present, many production scheduling systems have been developed. However, a lot of customization according to individual production environment is required, and then a large investment for development and maintenance is indispensable. Therefore now the direction to construct scheduling systems should be changed. The final objective of this research aims at developing a system which is built by it extracting the scheduling technique automatically through the daily production scheduling work, so that an investment will be decreased. This paper shows a prototype of Gantt Chart Interface System that emulates the production scheduling work on papers. Through the analysis of operator's operations, this paper proposes how to extract the master information required by production scheduling. Using the information, the scheduling operators can be supported to accelerate the scheduling work easily and accurately without any restriction of scheduling operations. By installing this extraction mechanism, it is easy to introduce scheduling system without a lot of expense for customization. In this paper, the extraction mechanism of the master information and operator support functions are proposed through a model expressing a scheduling problem.

  • DBRスケジューリングにおける動的バッファサイズ決定モデル

    朴 淳英, 文 全一, 禹 棋允, 藤村 茂

    平成17年電気学会 電子・情報・システム部門大会講演論文集     617 - 622  2005年09月

  • 生産スケジューリング業務のためのガントチャートインタフェースシステム

    清水 康弘, 藤村 茂

    平成17年電気学会 電子・情報・システム部門大会講演論文集     615 - 616  2005年09月

  • リアルタイムバッファ管理方式のシミュレーションによる評価

    禹 棋允, 朴 淳英, 藤村 茂

    平成17年電気学会 電子・情報・システム部門大会講演論文集     611 - 614  2005年09月

  • The Study on Evaluation of Adaptive interface by applying static, adaptive, and adaptable menus into context-aware device

    Sunjue Lee, Shigeru Fujimura

    平成17年電気学会 電子・情報・システム部門大会講演論文集     609 - 610  2005年09月

  • The Real-Time Buffer Management for DBR Scheduling

    Kiyun Woo, Soonyoung Park, Shigeru Fujimura

    the 18th International Conference on Production Research    2005年08月

  • Gantt Chart Interface System for Production Scheduling Work

    Shigeru Fujimura, Kiyun Woo

    the 18th International Conference on Production Research, Salerno, Italy    2005年08月

  • 生産スケジューリング業務のためのガントチャートインタフェースシステム

    藤村 茂, 禹 棋允

    情報処理学会第67回全国大会   ( 4 ) 607 - 610  2005年03月

  • 反復型ソフトウェア開発におけるスケジューリング手法

    張, 藤村 茂

    平成17年電気学会全国大会   ( 3-114 ) 171 - 172  2005年03月

  • DBRスケジューリングにおけるアラーム抑制機能

    禹 棋允, 藤村 茂

    平成17年電気学会全国大会   ( 4-248 ) 393 - 394  2005年03月

  • HYBRIDIZING ANT COLONY OPTIMIZATION WITH DISPATCHING HEURISTICS FOR JOB-SHOP SCHEDULING PROBLEM

    Haipeng Zhang, Mitsuo Gen, Shigeru Fujimura

    Proceedings of the fifth Asia Pacific Industrial Engineering and Management Systems Conference 2004     27.6.1 - 27.6.9  2004年12月

  • アジャイルソフトウェア開発プロジェクトスケジュール管理手法

    張, 禹 棋允, 藤村 茂

    平成16年電気学会 電子・情報・システム部門大会講演論文集     595 - 598  2004年09月

  • リアルタイム納期回答による企業間SCM実現方式

    茂地 純資, 藤村 茂

    平成16年電気学会 電子・情報・システム部門大会講演論文集     591 - 594  2004年09月

  • DBRスケジューリングにおけるリアルタイムバッファ管理方式

    禹 棋允, 朴 淳英, 藤村 茂

    平成16年電気学会 電子・情報・システム部門大会講演論文集     587 - 590  2004年09月

  • DBRスケジューリングにおけるバッファサイズ自動決定手法

    朴 淳英, 禹 棋允, 藤村 茂

    平成16年電気学会 電子・情報・システム部門大会講演論文集     583 - 586  2004年09月

  • Hybrid Ant Colony Optimization Approach for Job-shop Scheduling Problem

    Haipeng Zhang, Mitsuo Gen, Shigeru Fujimura, Kwan Woo Kim

    20th Fuzzy System Symposium     304 - 305  2004年06月

  • Ant Colony Optimization approach for Job-shop Scheduling Problem

    Haipeng Zhang, Mitsuo Gen, Shigeru Fujimura, Kwan Woo Kim

    PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES   3   426 - 431  2004年  [査読有り]

     概要を見る

    Ant Colony Optimization (ACO) is recently proposed as one of meta-heuristic methods for solving, hard combinatorial optimization problems.,,Job-shop Scheduling Problem (JSP) is to determine the, operation sequences on the machines for minimizing a makespan, and also has been confirmed as one of NP-hard problems.
    In this paper, an ACO approach for solving JSP is presented. We propose hybrid ACO that is combined other heuristic method to find good solution. The traditional heuristic methods include shortest processing time (SPT), longest processing time (LPT), shortest remaining time (SRT), longest remaining time (LRT), longest remaining time excluding the operation under consideration (LRM) for assigning priorities to the unscheduled operations is defined. Some numerical examples are demonstrated to show the performance of JSP using hybrid ACO.

  • Design for Inventory Management and Production Planning in ERP System

    Haipeng Zhang, Dingwei Wang, Jun Gong, Shigeru Fujimura, Mitsuo Gen

    2003 Asia Pacific Symposium on Intelligent and Evolutionary Systems     256 - 262  2003年11月

  • 情報系における生産スケジューリングシステム構築の課題

    藤村 茂

    平成15年度日本設備管理学会秋季研究発表大会論文集     111 - 112  2003年11月

  • バッチプロセスにおける制御用処方情報とスケジューリング用情報の一元管理方法

    藤村 茂, 檜物 亮一

    電気学会論文誌C   122-C ( 5 ) 843 - 850  2002年05月

  • 視点の異なるスケジューリングシステムの融合

    藤村 茂, 檜物 亮一

    日本設備管理学会誌   12 ( 4 ) 142 - 147  2001年04月

  • 使えるスケジューラの傾向と対策−バッチシステムへの適用−

    檜物 亮一, 藤村 茂

    計装   43 ( 12 ) 22 - 26  2000年11月

  • 生産現場の情報システム構築ガイド−21世紀を展望したシステムのあり方研究−

    共著

    (社)日本プラントメンテナンス協会    1998年03月

  • 横河電機におけるスケジューラの開発とその応用−バッチプロセスにおけるスケジューリングシステムの必要性−

    藤村 茂

    日本科学技術連盟 品質管理   49 ( 3 ) 29 - 35  1998年03月

  • 製油所の最適化へ向けたスケジューリングシステムの特徴と実際

    藤村 茂, 府川 晶彦

    計装   40 ( 12 ) 10 - 16  1997年12月

  • 逆問題としてとらえた産業プロセス異常予測,逆問題としてとらえた産業プロセス異常予測調査専門委員会 編

    共著

    電気学会技術報告   第619号  1997年01月

  • 生産現場の情報システムのあり方−21世紀型工場へのナビゲーター−

    共著

    (社)日本プラントメンテナンス協会    1996年03月

  • 知的システム構築用シェルHyperAukの構築支援環境

    藤村 茂, 富田 昭司, 桑原 修二

    計測自動制御学会論文誌   31 ( 7 ) 898 - 907  1995年07月

  • プラント操業スケジューリングシステムの実用化手法

    藤村 茂, 三竹 治子, 富田 昭司, 高橋 公一

    計測自動制御学会論文誌   31 ( 7 ) 923 - 932  1995年07月

  • プラント診断モデルベース推論システム

    藤村 茂, 富田 昭司, 檜物 亮一, 佐藤 千恵

    日本設備管理学会誌   6 ( 4 ) 234 - 241  1995年03月

  • バッチプラント生産スケジューリングシステム−その実用化への問題点と実プラントによる検証−

    富田 昭司, 藤村 茂, 檜物 亮一

    計測自動制御学会論文誌   29 ( 7 ) 843 - 850  1993年07月

  • スケジューリングパッケージExanalp

    三浦 真太郎, 藤村 茂, 酒井 治子, 清水 雅嗣

    横河技報   37 ( 1 ) 19 - 22  1993年01月

  • 平成3年度 AI等の計測応用動向調査活動報告書

    共著

    (社)日本電気計測器工業会 技術振興委員会 AI等計測応用動向調査WG    1992年03月

  • オブジェクト指向開発環境検討部会海外調査報告書(シグマ-C-9104)

    共著

    (株)シグマシステム 平成3年度シグマ会開発技術高度化委員会オブジェクト指向開発環境検討部会    1992年03月

  • MVCの拡張,MVCGとそれに基づくUIMS,Talkieの実装

    桑原 修二, 藤村 茂, 富田 昭司

    日本ソフトウェア科学会論文誌   9 ( 1 ) 27 - 41  1992年01月

  • 知的蒸留塔運転訓練用ガイダンスシステム

    富田 昭司, 藤村 茂, 飯間 昇, 鈴木 明

    電気学会論文誌C   110-C ( 10 ) 691 - 698  1990年11月

  • プロセス監視システムにおけるルール構築手法

    富田 昭司, 藤村 茂, 鈴木 明

    計測自動制御学会論文誌   26 ( 8 ) 924 - 926  1990年08月

  • オブジェクト指向知識表現aukを用いた知的システム構築用シェルAUK

    藤村 茂, 富田 昭司, 飯間 昇, 鈴木 明

    情報処理学会論文誌   31 ( 1 ) 76 - 87  1990年01月

  • オブジェクト指向知識情報処理システム

    鈴木 明, 藤村 茂, 富田 昭司, 飯間 昇

    横河技報   33 ( 3 ) 167 - 172  1989年03月

  • あいまい概念を扱う知識表現における目標指向型推論

    吉江 修, 藤村 茂, 宮地 裕樹, 秋月 影雄

    計測自動制御学会論文誌   22 ( 9 ) 935 - 941  1986年09月

▼全件表示

産業財産権

  • 挙動予測システム及び挙動予測方法

    藤村 茂

    特許権

受賞

  • (社)発明協会 関東地方表彰 発明奨励賞

    2003年11月  

  • (社)電気学会 論文発表賞

    1994年10月  

共同研究・競争的資金等の研究課題

  • ディープラーニングを用いたプロセス産業のオペレータ支援機能に関する研究

    研究期間:

    2019年04月
    -
    2022年03月
     

     概要を見る

    第4次産業革命の実現やIoT(Internet of Things)の導入を日本のプロセス産業で成功させるため,プロセス制御監視システムによって蓄積された時々刻々変化する時系列データを利用しディープラーニング技術を応用した実プロセスで利用可能なオペレータ支援機能を実現する.本研究課題のアプローチは,正常時の複数の時系列データを入力情報とし,1時系列データの将来の挙動を予測するものである.現場力を重んじる日本のプロセス産業において,熟練オペレータに対するポカミス防止,新人オペレータに対するプロセス知識において気づきを与える予測表示機能によるオペレータ支援機能を実現する

  • 業務・生産プロセス改善と同期したスパイラル進化可能なスケジューリングシステム

    研究期間:

    2015年04月
    -
    2018年03月
     

     概要を見る

    本研究課題は,生産業務および生産プロセスの改善活動と同期したスパイラル進化可能な生産スケジューリングシステムを提案することを目的としている.スパイラル進化とは,システム導入後の生産業務・プロセスの改善活動による生産をとりまく環境の変化に対して,システムが逐次システム自身も変化させ適合していく仕組みである.従来の生産スケジューリングシステムは,個々の生産プロセスに特化した形で導入されてきたが,本システムは単純な機能から利用を開始し,徐々に変化していく仕組みを導入し,初期導入およびメンテナンスを容易にする

  • 生産スケジューリング業務プロセスモデリングによるシステム化規範構築に関する研究

    研究期間:

    2011年04月
    -
    2014年03月
     

     概要を見る

    本研究課題の目的は,生産スケジューリングの業務プロセスモデリングを行い,システム化規範を構築することである.具体的には業務プロセスモデルを明確にし,そのモデルに適合するシステム化モジュールの機能およびインタフェース仕様を定め,システム化モジュールを用いたシステム化規範を提案することである.本研究課題では,(1)現状のシステム構築の問題点を整理し,その問題点を克服するためのシステム化規範をまとめ,(2)スケジューリング業務と製造プロセスの改善作業を同期させ進化させるスパイラル進化型システム開発規範をまとめ,それに従った生産スケジューリングシステムを開発しその有効性を評価した

  • 自己構築型生産スケジューリングシステムの開発

    研究期間:

    2007年
    -
     
     

  • 半導体後工程生産負荷分散システムの構築

    研究期間:

    2007年
    -
     
     

  • プロジェクト管理システムの構築

    研究期間:

    2006年
    -
     
     

  • 生産スケジューラソフトウェアのスケジューリングロジックエンジンの実証研究

    研究期間:

    2003年
    -
    2004年
     

  • 自己構築型スケジューリングシステムに関する研究

     概要を見る

    本研究の目的は,日常の生産スケジューリング操作を通じて立案手法を習得する自己構築型の生産スケジューリングシステムを構築することである.従来のシステムでは,システムを利用する前に,スケジューリング業務で利用されるマスタ情報やスケジューリング手法をシステム上に初期設定する必要がある.そこで,これらの情報の初期設定を行う必要なくシステムを利用することができる仕組みについて研究を行う.まず,紙面上のガントチャートによる生産スケジューリング業務を模擬したガントチャートシステムの開発を行った.そして,種々のプロセスのスケジューリング業務に対してこのシステムを適用し評価を行った.この評価を通じて,マスタ情報を抽出するメカニズム,立案手法の手順を学習するメカニズムについて検討を行った.具体的には,本ガントチャートシステム上で,作業と呼ばれるスケジューリング対象(生産を行う処理の単位)の操作,作業間の関連を意識した時間移動操作などの履歴情報から有用な情報を自動抽出し利用するメカニズムを構築する仕組みを検討した.この仕組みは,生産プロセスの物理的な知識を自動構築するというアプローチとは異なり,種々の形態のスケジューリング手法に適用するために,ガントチャート上の作業群に対する操作を,図形操作情報として扱い,そのような情報を抽出し利用するというアプローチに基づいている

  • オーダライフサイクルマネジメントと生産スケジューリングの融合に関する研究

     概要を見る

    オーダライフサイクルマネジメント(Order Life-cycle Management : OLM)は,製造業で扱われる様々な種類のオーダ情報の変化を管理する概念である.状況が動的に変化する環境において,OLMは有効な情報を与え,意思決定作業を迅速かつ的確なものにする.本研究では,高い性能のサプライチェーンを実現するために,生産計画・スケジューリング機能とOLMを協調的に融合する新しいアプローチを提案している.具体的にはオーダ遷移モデルを提案し,そのモデルを利用したオーダデータベースを構築し,多段階生産計画・スケジューリング機能との接続プロトコルを整備している

▼全件表示

特定課題研究

  • 作業者の操作手順を指示するARマニュアル構築手法に関する研究

    2021年  

     概要を見る

    本申請研究課題では,製造業の現場力に焦点をあて,熟練者が何気なく実施している作業を分析し,熟練者の知識を基盤とした作業支援マニュアルをAR(Augmented Reality : 拡張現実)技術を駆使して実現することを目的とした.このような作業支援マニュアルを実現するために,まず,熟練者の視線の動きから熟練者の思考の過程を分析し,どのような情報を作業者に示すことが作業を遂行するために必要かを分析し,分析結果を利用していかに有用な情報を拡張視野に取り込み作業者支援ができるかについて検討した.そして,機器メンテナンスのために定期的に行われる分解・組立作業のAR作業支援マニュアルのプロトタイプを開発し評価を行った.

  • 溶接作業のリアルタイム診断による作業者支援のための工知能システムの開発

    2020年  

     概要を見る

    作業の熟練度が製品の加工状態に大きな影響を与える作業として溶接作業を取り上げ、熟練者の作業モデルを開発し、そのモデルを利用した溶接作業診断システムの提案を行うことを目的とした。熟練者の“手の動き”を捉えるためには6軸モーションセンサ(3軸の加速度および3軸の角速度センサ)をどのように熟練者の技能継承に利用するかがポイントとなった。熟練者の作業と初心者の作業の違いがどのようなところに存在するかを調査し、それらの違いを感知するためのセンサを検討し、実データの収集・分析し、熟練者の作業との差異を識別して作業者に作業の状態の診断結果を示す人工知能のモデル(機械学習モデル)を実現した。

  • 熟練者の視線解析によるAR作業支援マニュアル構築手法に関する研究

    2019年  

     概要を見る

    本研究課題では,製造業の現場力に焦点をあて,熟練者が実施している作業を分析し,熟練者の知識を基盤とした作業支援マニュアルをAR(Augmented Reality : 拡張現実)技術を駆使して実現することを目的とした.そこで,まず,熟練者の視線の動きから熟練者の思考の過程を分析し,どのような情報を作業者に示すことが作業を遂行するために必要かを解析した.そして,解析結果を利用して,現在利用されている紙媒体(紙面)マニュアルや動画マニュアルの問題点や改善方法を解析した.そしてAR技術を利用して,いかに有用な情報を拡張視野に取り込み作業者支援できるかに関して検討した.

  • ディープラーニングを用いたプロセス産業のオペレータ支援機能に関する研究

    2018年  

     概要を見る

    第4次産業革命の実現やIoTの導入を日本のプロセス産業で成功させるため,プロセス制御監視システムによって蓄積されてきた時々刻々変化する時系列データを利用し,ディープラーニング技術を応用したオペレータ支援用のモデルを構築する.今年度は,プロセスオペレータの支援機能を実現する基本的なモデルを提案し,その有効性を確認した.このモデルは,複数のプロセス時系列データを入力として,予測したい一つのプロセス時系列データの将来の挙動を予測するモデルであり,予測した正常データと異常データの乖離から異常状態を検知しオペレータに通知できることを確認した.

  • ディープラーニングを利用したボイラープラント監視制御システムにおける異常予知に関する研究

    2018年  

     概要を見る

    本研究課題は,ボイラープラントのプロセス制御監視生産システムにおける異常予知システムの実現を目的としている.今年度は,ボイラープラントにおけるバーナー制御,燃料O2制御,チューブ劣化,ダンパー制御等の重要な部分の一部を対象とし,オペレータ支援機能を含む異常予知システムを実現するためのディープニューラルネットワークのモデルを提案した.まず,企業でのヒアリングを実施し,実際のプラントオペレーションの方法を解析した.そして,ボイラープラントの異常予知に汎用的に利用できる一つのディープラーニングのモデルを提案し,実プラントでのデータを利用してこのモデルの有効性を評価した.

  • 工場内の熟練者のノウハウ抽出のための動線・視線解析システムの開発

    2017年  

     概要を見る

     工場において生産性を向上させ作業者が快適に働ける環境を実現するために,IoTの導入は大変期待されている.また,工場における熟練者の存在はこれらの課題の解決に大きく寄与するが,暗黙知として熟練者が利用しているノウハウを解析しシステム化することは大変難しい.そこで,本研究課題では,実際の製造工場での熟練者の動きを解析し意思決定がどのように行なわれているかを解析する手法を検討した.具体的には,実際の製造工場での熟練者の視線の動きを解析し,熟練者のノウハウを形式知化するための視線移動解析手法を整理した.また,工場内の動線を簡易に比較的に安価で解析できる深層学習を利用したツールのプロトタイプを開発した.

  • スマートファクトリ実現に向けたニーズ・技術シーズマッチングとその情報公開

    2016年  

     概要を見る

    本研究課題では,Industrie4.0およびIoT (Internet of Things)の適用の理想を単に提唱するだけではなく,実際の技術シーズの裏付けのもとでスマートファクトリの実現方法を検討した. 実際の企業に対して生産システム側のニーズのヒアリングを実施し,スマートファクトリ実現に向けたIndustrie4.0およびIoTの適用方法を検討し,スマートファクトリ実現に向けた議論を実施した.また,生産システム運用の2つのユースケースに対して技術シーズをマッチングさせ,より詳細な実現方法を検討し提案した.具体的には,熟練者の視線の動きをトラッキングし,熟練者の思考過程を分析し,生産システムの運転に役立てる方法を議論した.

  • スパイラル進化可能なスケジューリングシステムの付帯機能実装

    2014年  

     概要を見る

     本助成費の申請は,業務・生産プロセス改善と同期したスパイラル進化可能なスケジューリングシステムの付帯機能実装に関するものである.本申請では,業務および生産プロセスの改善と同期してスパイラル進化(変化,変化に対する問題点の発見,発見された問題点の改善,そして更なる変化という変化のスパイラルに同期してシステムを進化させていくこと)が可能な生産スケジューリングシステムを開発し,実際の工場での評価のためにシステムのインストーラや利用方法をサポートするヘルプ機能等の付帯機能を実現した.これらの付帯機能は,本システムの本来の目的であるユーザによる導入および利用を可能とするために必要な機能である.現在,2社の工場で評価のために利用を開始してもらっている.システム設定はすべて工場のシステム管理者の方に実施してもらった.本システム稼働のためのネットワーク環境の設定に時間を要したが,本システムの設定については特に問題もなく,現在も継続して利用してもらっている.また,追加評価のために,現在,他の企業に対しても積極的に利用をお願いしている状況にある.これらの評価を元に,生産管理ベンダーへの提案を行うことを予定している.

  • 業務・生産プロセス改善と同期したスパイラル進化可能なスケジューリングシステム

    2014年  

     概要を見る

      本研究では,業務および生産プロセスの改善と同期してスパイラル進化可能な生産スケジューリングシステムについて,企業からヒアリングを実施し,仕様の明確化を行い,実績収集機能のプロトタイプシステムを作成した.スパイラル進化とは,変化,変化に対する問題点の発見,発見された問題点の改善,そして更なる変化...という変化のスパイラルに同期してシステムを進化させていく概念である.具体的には以下の内容を実施した.(1)実績収集機能の実現:携帯端末からの在庫量,生産量,歩留りなどの数値実績の収集機能を実現した.各々の情報の収集は,作業者の操作方法についての意見を取り入れ,実作業の妨げにならない方法を検討し実装した.現在の作業実績の入力は,携帯端末を利用し,作業指示,品目,作業種別,工程などの情報を2次元コードを利用して入力する方法を用いている.この方法を基本とし,在庫量,生産量,歩留りの入力も携帯端末から行うものとした. (2)実績収集機能の実プロセスでの評価:実績収集機能を実プロセスで利用し,作業者のデータ入力の負担度を検証した.負担がかかる部分については, 作業者の情報以外にもICカードの利用を検討し今後の課題とした.

  • 生産・物流におけるもの時空間情報に基づくスパイラル導入スケジューリングシステム

    2013年  

     概要を見る

     本研究課題では,製造業における生産業務および生産プロセスの改善と同期して“スパイラル進化”可能な生産スケジューリングシステムを提案することを目的としている.“スパイラル進化”とは,変化,変化に対する問題点の発見,発見された問題点の改善,そして更なる変化というスパイラルに同期してシステムを進化させていく概念である. 本研究課題にとりかかる前に,このような概念に従い既に実装したシステムでは,Android端末によるQRコードの読み込みによって作業実績を入力し,スケジューリングマスタ情報入力なしで作業の進捗状況のガントチャート(時刻を表す横軸に対して事象の時間を矩形で表示するチャート)表示によって見える化を行う仕組みを実現している.そして,この作業実績からマスタ情報を抽出する仕組みを実現し,実績とスケジュール対比による業務・生産プロセスの改善を行うことを可能としている. 本研究課題では,このシステムをベースにして,中小企業において,より導入しやすいスケジューリングシステムを目指し,在庫,およびものの場所の移動実績情報の入力により製造現場の状況をとらえスケジューリングに役に立てる方法を提案しシステムを実装した. 本システムは,製造プロセスの実績イベントを収集する実績イベント収集機能,製造プロセスの過去の情報を管理するデータ管理機能,製造プロセスの状況を把握するための進捗監視機能,生産オーダに対する生産方法を決定し生産スケジュールを生成するスケジューリング機能,生産スケジュールを生成するために必要な生産方法を指定する処方の情報を生成し管理する処方生成管理機能からなる.実績イベント収集機能は,原料,中間製品,最終製品の在庫状況を把握するための入庫,出庫,現在庫情報を収集するための機能である.収集されたイベントはデータ管理機能によって管理される.進捗監視機能は,データ管理機能で管理されているデータを利用してリアルタイムに進捗状況を表示する機能である.スケジューリング機能は,生産オーダの情報に基づいて生産スケジュールを生成する機能である. 現在,本システムの実装を終了し,実際の生産プロセスにおいて検証を実施する準備を行っているところである.

  • 自己組織化生産スケジューリングシステムの基盤技術の研究

    2003年  

     概要を見る

     本研究では、マスタ情報やスケジューリング手法の記述を行わず、ユーザが行うスケジューリング時の操作情報からスケジューリング手法やスケジュール対象の作業(スケジューリングされる資源(設備等)を利用して行う処理の単位)間の関連を抽出し、スケジューリングロジックを自己組織化していく生産スケジューリングシステムを開発することを目的としている。本目的は、システムの初期導入時およびメンテナンス時に多大なシステム開発工数が割かれているという現状の問題点に起因している。 本年度は,本研究の初期段階として,自己組織化していく機能要件をスケジューリングパターンとして抽出して,その実現手法を検討することを目的として研究を行ってきた。従来,スケジューリングシステムは複雑なモデルのもとで扱われ,適用する対象プロセスの特性に応じて固有のモデルが適用されていた。しかし,自己組織化を行うモデルとしては,このようなモデルは不適切であり単純なモデルが必要となる。そこで,ゴールドラットが提唱しているTOC(Theory of Constraints)のモデルを基本として,実プロセスでの応用を念頭に置き,いくつかの実プロセスへのモデルの適用を行い,下記のようなモデルの拡張の有効性を確認した。・プロダクトミックスに対応すべく制約資源の同定機能・スケジューリング状況に従ったタイムバッファの動的決定方式・階層的モデルによるエージェントモデル 現在これらの拡張機能について検討を行っておりアルゴリズムの実装を行っている。また,これらのアルゴリズムは,現在,市販のスケジューリングシステムのスケジューリングエンジンとして実装することを計画しており,来年度は,実プロセスでのフィールドテストを行い,その有効性を論文にまとめる予定である。

▼全件表示

 

現在担当している科目

▼全件表示