The Research Of Appoint Job Scheduling Problem Based On Discrete Event Dynamic Systems

The Appoint Job Scheduling Problem is an important task of the Flow Shop Scheduling Problem. It exists in the great Supermarkets, the great Retail Multiple Shops and the Centers of Flow Shop. With the increasingly enhancing of the economic activity which spans different domains, it is pressed for to settle the scheduling problems to carry out product scheme and reduce storage; thereby we can increase enterprise's efficiency. But at present, researches on the Appoint Job Scheduling Problem focus on the domains of configure traffic tools and static scheduling. These researches have already gained great fruit and their resultshave been mostly used in decision-making and administer domain. But there isn't much attention paid to the change of traffic running condition and the dynamic creation of task, and there are only a few online Appoint Job Scheduling computer systems products. Given this problem, traffic tools' dynamic scheduling is analyzed and studied by applying DEDS (Discrete Event Dynamic System) theory and a simple system framework of online Appoint Job Scheduling computer system is provided in this article.This article analyses the Appoint Job Scheduling Problem' properties and provides the mathematic definition based on the description of the Appoint Job Scheduling Problem .The article finds that the Appoint Job Scheduling Problem has two main attribution: Dynamic and Discrete .In order to express the problem completely and carry out scheduling dynamically and continually, this article establishes the Appoint Scheduling Problem's static model and system mode separately. And the Closed Loop is provided in the article, which is used to decide the running direction and transport cost of the vehicles when they are taking on theappoint tasks. And this article discusses the relation between theAppoint Job Scheduling Problem and the Closed Loop particularly. At last this article provides scheduling algorithms and system's simulation results.In practical aspect, this article solves the problem of traffic tools running and dynamic scheduling problem in immobility domain and validates the feasibility of the theory and method provided in the article.At the end of this article some useful conclusions and prospects of using these theory and algorithm to solve Appoint Job Scheduling Problem are given.The framework of Appoint Job Scheduling computer systems in this article and the express of the manner of vehicle' running can describe Appoint Job Scheduling problems in immobility domain easily, so that we can settle Appoint Job Scheduling problems by programs. After research on Appoint Job Scheduling problems this article provides the base of theory and the guidance of systems design.