Autor: |
Kadu, Neha, Prawesh, Shankar, Khanra, Avijit, Naoyuki Fujiwara, Yuichi Koga, Yosuke Watanabe |
Předmět: |
|
Zdroj: |
IEOM Annual International Conference Proceedings; 2024, p1919-1929, 11p |
Abstrakt: |
In this work, we propose a novel framework for the development of real-time large-scale production scheduling. The problem that we study originated from the Digital Innovation Headquarters division of Mitsubishi Heavy Industries, Ltd. (MHI), which faced the challenge of developing a large-scale just-in-time (JIT) job-shop scheduling software that could schedule up to a quarter million jobs and 6.2 million operations within an hour. We designed the algorithm for scheduling and used list data structure for storing the resource availability. We used Ousterhout matrix as a benchmark, which is popularly used for slot scheduling and shows that our approach significantly improves the runtime. Our study highlights the implementation of data structures in Job-shop scheduling problems. [ABSTRACT FROM AUTHOR] |
Databáze: |
Complementary Index |
Externí odkaz: |
|