The Application of Banker`s Algorithm in Order Scheduling Management for Deadlock Avoidance

Abstract

Order Scheduling in product supply chain is an important activity to adequately manage cash flow for supplier. However, in current order scheduling, deadlock may appear when managing multiple supply chain flows simultaneously. This paper proposes a deadlock avoidance method for order scheduling in product supply chain system by adopting Banker’s algorithm which is a commonly used in operating systems for deadlock avoidance. After thorough analysis and comparisons, Banker’s algorithm is utilized to manage order scheduling in product supply chain instead of managing memories in operating systems. As a result, order scheduling can be managed effectively with dramatically less chances of deadlock when handling multiple orders. To verify the proposed method, SPIN is used to simulate and verify the correctness.