Flexible Job-Shop Scheduling Method for Highly-Distributed Manufacturing Systems
-
- MORINAGA Eiji
- 大阪大学 大学院工学研究科 マテリアル生産科学専攻
-
- NAKAMURA Tomomi
- 大阪大学 大学院工学研究科 マテリアル生産科学専攻 Currently, Osaka Works, Sumitomo Electric Industries, Ltd.
-
- WAKAMATSU Hidefumi
- 大阪大学 大学院工学研究科 マテリアル生産科学専攻
-
- ARAI Eiji
- 大阪大学 大学院工学研究科 マテリアル生産科学専攻
この論文をさがす
抄録
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 of Smart Processing
-
Journal of Smart Processing 6 (5), 181-187, 2017
一般社団法人 スマートプロセス学会 (旧高温学会)
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390845713037566464
-
- NII論文ID
- 130007542803
-
- NII書誌ID
- AA12553487
-
- ISSN
- 21871337
- 2186702X
-
- NDL書誌ID
- 028557408
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
- KAKEN
-
- 抄録ライセンスフラグ
- 使用不可