The Emergency Scheduling Engineering in Single Resource Center

Abstract This paper attempts to study the scheduling scheme in emergency resource center. The scheduling engineering in resource center can be divided into two stages: the normal stage and emergency stage. In the normal stage, orders come brokenly to the resource center in small number, and the order seldom has emergency requirement. In contrast, a large number of orders, which always have different emergency requirements, reach the resource center in a very short time. This paper analyzes the differences between the normal stage and emergency stage, and proposes the corresponding scheduling methods of two stages. In order to feed the different emergency requirements of orders, various weights are given to different orders. A polynomial algorithm is proposed to minimize the weighted makespan of emergency resource scheduling. Furthermore, a dynamic algorithm is designed to solve the dynamic emergency scheduling.