Flexible Job-Shop Scheduling Method for Highly-Distributed Manufacturing Systems

DOI Web Site Web Site 3 Citations 13 References
  • MORINAGA Eiji
    Osaka University Division of Materials and Manufacturing Science
  • NAKAMURA Tomomi
    Osaka University Division of Materials and Manufacturing Science 現 住友電気工業株式会社 大阪製作所
  • WAKAMATSU Hidefumi
    Osaka University Division of Materials and Manufacturing Science
  • ARAI Eiji
    Osaka University Division of Materials and Manufacturing Science

Search this article

Abstract

Development in computer and network technologies is realizing highly-distributed manufacturing systems (HDMSs) where each facility is computerized and can communicate with each other. Distributed discrete event simulation taking advantage of this hardware environment has been discussed, and an algorithm for priority sequencing by communication among facilities was developed. This algorithm is also applicable to production scheduling with dispatching rules, and a distributed method of job-shop scheduling was proposed. This paper describes enhancement of this method for flexible job-shop where alternative machines exist. Mechanism for updating priority sequence for obtaining intermediate products is developed using that algorithm. Incorporating this mechanism enables application of the previous method to the flexible job-shop scheduling. Feasibility of the proposed method was shown by an example.

Journal

  • Journal of Smart Processing

    Journal of Smart Processing 6 (5), 181-187, 2017

    Smart Processing Society for Materials, Environment & Energy (High Temperature Society of Japan)

Citations (3)*help

See more

References(13)*help

See more

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top