Scalability and performance of computational structures for real-time order promising

摘要

This paper analyzes the scalability and performance of computational structures used in an order promising method designed for discrete build-to-order environments facing dynamic order arrivals. Main-memory database technology and supporting index structures are exploited to improve scalability of this data-intensive procedure so that orders can be promised in real time for industrial-sized systems. Two index structures, a linear structure and a tree structure, are compared. The tree structure improves response times and also has higher scalability at the expense of larger memory requirements compared to the linear structure. Performance of the method is evaluated under two manufacturing scenarios: a tandem line and an assembly shop. Computational results obtained from large-scale simulation studies of realistic systems with 60 resources show the method to be robust. Accuracy of the method in terms of median absolute lateness surpasses that of due date assignment methods previously examined in the literature.