A Kind Of Research Of Processing Procedure Optimization For Nonstandard Job-Shop Scheduling

The standard Job-Shop scheduling needs all kinds of processing devices are single but the processing of practical enterprise can properly add the device that has effect on the efficiency of production processing according to actual demand. So the standard Job-Shop scheduling has not satisfied the changing demand of processing of enterprise production, it is necessary to study and settle the nonstandard Job-Shop scheduling problem which has same processing devices. This paper aims to improve the efficiency of production processing by giving full play to the advantages of concurrency , asynchrony , distributing and juxtaposition in multi-production and multi-device processing, analyzes the processing flow chart of nonstandard Job-Shop problem and makes the operations be the dependent operations that have the only immediate predecessor and immediate successor or the independent operations in a period of time, namely, two types, then combined with the BFSM (best fit scheduling method) and the FFSM (first fit scheduling method) about memory scheduling in OS (operating system), a new near-optimum solution project which can solve the nonstandard Job-Shop scheduling problem is presented by analyzing. This project makes some improvement on the basis of scheduling algorithms of standard Job-Shop scheduling, for nonstandard Job-Shop scheduling problem, it can integrates advantages of some former scheduling algorithms and the characteristic of Job-Shop scheduling, such as the good idea of CPM (critical path method) and the juxtaposition of production processing. And it gives full play to the advantages that operations on same devices can be adjusted freely on the same devices, realizes the purpose of shortening the makes pan. By analyzing and designing the practical problem, showing the Gantt chart of result, the example validates that the project proposed in this paper not only has less restriction terms but has satisfying complexity and better optimized results.The near-optimum solution project of nonstandard Job-Shop scheduling proposed in the paper can solve the problem that nonstandard Job-Shop scheduling has more productions to process, when more processing flow charts of productions to process are made be a sub-tree of a big suppositional processing tree. And this is validated by example.This paper offers new research thought for both nonstandard Job-Shop scheduling problem and the problem that nonstandard Job-Shop scheduling has more productions, which has important value both in practice and theory.